./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_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_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ca2361d71ac2cf79edaee81010c8705ab39c08 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:41:12,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:41:12,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:41:12,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:41:12,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:41:12,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:41:12,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:41:12,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:41:12,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:41:12,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:41:12,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:41:12,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:41:12,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:41:12,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:41:12,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:41:12,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:41:12,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:41:12,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:41:12,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:41:12,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:41:12,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:41:12,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:41:12,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:41:12,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:41:12,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:41:12,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:41:12,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:41:12,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:41:12,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:41:12,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:41:12,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:41:12,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:41:12,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:41:12,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:41:12,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:41:12,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:41:12,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:41:12,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:41:12,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:41:12,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:41:12,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:41:12,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:41:12,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:41:12,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:41:12,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:41:12,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:41:12,803 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:41:12,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:41:12,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:41:12,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:41:12,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:41:12,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:41:12,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:41:12,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:41:12,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:41:12,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:41:12,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:12,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:41:12,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ca2361d71ac2cf79edaee81010c8705ab39c08 [2019-12-07 17:41:12,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:41:12,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:41:12,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:41:12,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:41:12,915 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:41:12,915 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i [2019-12-07 17:41:12,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/data/c1c19a40b/cadff5f393c445618d401d0728ef0822/FLAG6bf53ca8e [2019-12-07 17:41:13,430 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:41:13,430 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/sv-benchmarks/c/pthread-wmm/safe013_pso.oepc.i [2019-12-07 17:41:13,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/data/c1c19a40b/cadff5f393c445618d401d0728ef0822/FLAG6bf53ca8e [2019-12-07 17:41:13,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/data/c1c19a40b/cadff5f393c445618d401d0728ef0822 [2019-12-07 17:41:13,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:41:13,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:41:13,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:13,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:41:13,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:41:13,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,458 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 05:41:13, skipping insertion in model container [2019-12-07 17:41:13,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:41:13,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:41:13,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:13,744 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:41:13,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:13,836 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:41:13,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13 WrapperNode [2019-12-07 17:41:13,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:13,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:13,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:41:13,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:41:13,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:13,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:41:13,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:41:13,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:41:13,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... [2019-12-07 17:41:13,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:41:13,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:41:13,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:41:13,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:41:13,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/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 17:41:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:41:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:41:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:41:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:41:13,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:41:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:41:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:41:13,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:41:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:41:13,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:41:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:41:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:41:13,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:41:13,954 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:41:14,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:41:14,291 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:41:14,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:14 BoogieIcfgContainer [2019-12-07 17:41:14,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:41:14,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:41:14,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:41:14,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:41:14,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:41:13" (1/3) ... [2019-12-07 17:41:14,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c27106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:14, skipping insertion in model container [2019-12-07 17:41:14,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:13" (2/3) ... [2019-12-07 17:41:14,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c27106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:14, skipping insertion in model container [2019-12-07 17:41:14,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:14" (3/3) ... [2019-12-07 17:41:14,296 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-07 17:41:14,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:41:14,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:41:14,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:41:14,307 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:41:14,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,350 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:14,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:41:14,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:41:14,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:41:14,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:41:14,385 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:41:14,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:41:14,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:41:14,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:41:14,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:41:14,396 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 17:41:14,397 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 17:41:14,450 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 17:41:14,450 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:41:14,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:41:14,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 17:41:14,504 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 17:41:14,504 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:41:14,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:41:14,526 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 17:41:14,527 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:41:17,554 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 17:41:17,702 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-07 17:41:17,702 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 17:41:17,705 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 17:41:27,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 17:41:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 17:41:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:41:27,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:27,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:41:27,924 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-07 17:41:27,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:27,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180307639] [2019-12-07 17:41:27,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:28,078 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 17:41:28,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180307639] [2019-12-07 17:41:28,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:28,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:41:28,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366001455] [2019-12-07 17:41:28,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:41:28,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:41:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:28,099 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 17:41:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:28,649 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 17:41:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:41:28,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:41:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:29,008 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 17:41:29,008 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 17:41:29,009 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 17:41:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 17:41:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 17:41:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 17:41:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 17:41:33,515 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 17:41:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:33,516 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 17:41:33,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:41:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 17:41:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:41:33,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:33,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:33,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-07 17:41:33,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:33,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417405632] [2019-12-07 17:41:33,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:33,582 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 17:41:33,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417405632] [2019-12-07 17:41:33,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:33,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:41:33,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192246163] [2019-12-07 17:41:33,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:33,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:33,584 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 17:41:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:34,349 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 17:41:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:41:34,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:41:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:36,366 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 17:41:36,366 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 17:41:36,367 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 17:41:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 17:41:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 17:41:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 17:41:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 17:41:41,891 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 17:41:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:41,892 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 17:41:41,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 17:41:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:41:41,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:41,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:41,895 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-07 17:41:41,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:41,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342550740] [2019-12-07 17:41:41,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:41,944 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 17:41:41,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342550740] [2019-12-07 17:41:41,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:41,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:41:41,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377947049] [2019-12-07 17:41:41,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:41,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:41,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:41,945 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 17:41:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:42,762 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-07 17:41:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:41:42,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:41:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:43,188 INFO L225 Difference]: With dead ends: 159677 [2019-12-07 17:41:43,189 INFO L226 Difference]: Without dead ends: 159565 [2019-12-07 17:41:43,189 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 17:41:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-07 17:41:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-07 17:41:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-07 17:41:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-07 17:41:51,149 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-07 17:41:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:51,149 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-07 17:41:51,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-07 17:41:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:41:51,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:51,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:51,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-07 17:41:51,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:51,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882048292] [2019-12-07 17:41:51,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:51,191 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 17:41:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882048292] [2019-12-07 17:41:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:41:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421662769] [2019-12-07 17:41:51,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:41:51,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:41:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:51,192 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-07 17:41:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:52,317 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-07 17:41:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:41:52,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:41:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:52,785 INFO L225 Difference]: With dead ends: 181618 [2019-12-07 17:41:52,785 INFO L226 Difference]: Without dead ends: 181618 [2019-12-07 17:41:52,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-07 17:41:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-07 17:41:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-07 17:42:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-07 17:42:00,129 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-07 17:42:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:00,129 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-07 17:42:00,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-07 17:42:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:00,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:00,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:00,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-07 17:42:00,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:00,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20526963] [2019-12-07 17:42:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:00,179 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 17:42:00,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20526963] [2019-12-07 17:42:00,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:00,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:00,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758886615] [2019-12-07 17:42:00,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:00,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:00,180 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-07 17:42:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:01,089 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-07 17:42:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:01,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:42:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:01,541 INFO L225 Difference]: With dead ends: 179622 [2019-12-07 17:42:01,542 INFO L226 Difference]: Without dead ends: 179542 [2019-12-07 17:42:01,542 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 17:42:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-07 17:42:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-07 17:42:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-07 17:42:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-07 17:42:10,750 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-07 17:42:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:10,750 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-07 17:42:10,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-07 17:42:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:10,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:10,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:10,754 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-07 17:42:10,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:10,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272517996] [2019-12-07 17:42:10,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:10,785 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 17:42:10,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272517996] [2019-12-07 17:42:10,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:10,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:10,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855374003] [2019-12-07 17:42:10,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:10,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:10,787 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-07 17:42:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:11,737 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-07 17:42:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:11,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:42:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,222 INFO L225 Difference]: With dead ends: 189091 [2019-12-07 17:42:12,222 INFO L226 Difference]: Without dead ends: 188995 [2019-12-07 17:42:12,223 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 17:42:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-07 17:42:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-07 17:42:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-07 17:42:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-07 17:42:19,566 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-07 17:42:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:19,566 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-07 17:42:19,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-07 17:42:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:42:19,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:19,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:19,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-07 17:42:19,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:19,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377353410] [2019-12-07 17:42:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:19,625 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 17:42:19,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377353410] [2019-12-07 17:42:19,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:19,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:19,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891693274] [2019-12-07 17:42:19,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:19,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:19,626 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-07 17:42:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:20,708 INFO L93 Difference]: Finished difference Result 152758 states and 623342 transitions. [2019-12-07 17:42:20,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:20,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:42:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:21,092 INFO L225 Difference]: With dead ends: 152758 [2019-12-07 17:42:21,092 INFO L226 Difference]: Without dead ends: 152758 [2019-12-07 17:42:21,092 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 17:42:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152758 states. [2019-12-07 17:42:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152758 to 148778. [2019-12-07 17:42:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148778 states. [2019-12-07 17:42:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148778 states to 148778 states and 608180 transitions. [2019-12-07 17:42:29,056 INFO L78 Accepts]: Start accepts. Automaton has 148778 states and 608180 transitions. Word has length 18 [2019-12-07 17:42:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 148778 states and 608180 transitions. [2019-12-07 17:42:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 148778 states and 608180 transitions. [2019-12-07 17:42:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:42:29,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:29,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:29,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 250695921, now seen corresponding path program 1 times [2019-12-07 17:42:29,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:29,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874644242] [2019-12-07 17:42:29,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:29,109 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 17:42:29,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874644242] [2019-12-07 17:42:29,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:29,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:29,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580460024] [2019-12-07 17:42:29,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:29,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:29,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:29,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:29,110 INFO L87 Difference]: Start difference. First operand 148778 states and 608180 transitions. Second operand 4 states. [2019-12-07 17:42:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:29,255 INFO L93 Difference]: Finished difference Result 40889 states and 141396 transitions. [2019-12-07 17:42:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:29,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:42:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:29,309 INFO L225 Difference]: With dead ends: 40889 [2019-12-07 17:42:29,309 INFO L226 Difference]: Without dead ends: 31903 [2019-12-07 17:42:29,310 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 17:42:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31903 states. [2019-12-07 17:42:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31903 to 31903. [2019-12-07 17:42:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31903 states. [2019-12-07 17:42:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31903 states to 31903 states and 105107 transitions. [2019-12-07 17:42:29,878 INFO L78 Accepts]: Start accepts. Automaton has 31903 states and 105107 transitions. Word has length 18 [2019-12-07 17:42:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:29,878 INFO L462 AbstractCegarLoop]: Abstraction has 31903 states and 105107 transitions. [2019-12-07 17:42:29,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 31903 states and 105107 transitions. [2019-12-07 17:42:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:42:29,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:29,885 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] [2019-12-07 17:42:29,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-07 17:42:29,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:29,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384011648] [2019-12-07 17:42:29,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:29,923 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 17:42:29,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384011648] [2019-12-07 17:42:29,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:29,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:29,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165027799] [2019-12-07 17:42:29,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:29,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:29,925 INFO L87 Difference]: Start difference. First operand 31903 states and 105107 transitions. Second operand 5 states. [2019-12-07 17:42:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:30,278 INFO L93 Difference]: Finished difference Result 43734 states and 141796 transitions. [2019-12-07 17:42:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:42:30,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:42:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:30,339 INFO L225 Difference]: With dead ends: 43734 [2019-12-07 17:42:30,339 INFO L226 Difference]: Without dead ends: 43558 [2019-12-07 17:42:30,340 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 17:42:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43558 states. [2019-12-07 17:42:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43558 to 32038. [2019-12-07 17:42:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32038 states. [2019-12-07 17:42:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32038 states to 32038 states and 105593 transitions. [2019-12-07 17:42:31,288 INFO L78 Accepts]: Start accepts. Automaton has 32038 states and 105593 transitions. Word has length 22 [2019-12-07 17:42:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:31,288 INFO L462 AbstractCegarLoop]: Abstraction has 32038 states and 105593 transitions. [2019-12-07 17:42:31,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32038 states and 105593 transitions. [2019-12-07 17:42:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:42:31,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:31,295 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] [2019-12-07 17:42:31,295 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-07 17:42:31,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:31,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285495082] [2019-12-07 17:42:31,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:31,328 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 17:42:31,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285495082] [2019-12-07 17:42:31,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:31,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:31,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870569341] [2019-12-07 17:42:31,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:31,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:31,329 INFO L87 Difference]: Start difference. First operand 32038 states and 105593 transitions. Second operand 5 states. [2019-12-07 17:42:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:31,705 INFO L93 Difference]: Finished difference Result 44028 states and 142710 transitions. [2019-12-07 17:42:31,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:42:31,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:42:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:31,769 INFO L225 Difference]: With dead ends: 44028 [2019-12-07 17:42:31,769 INFO L226 Difference]: Without dead ends: 43746 [2019-12-07 17:42:31,770 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 17:42:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43746 states. [2019-12-07 17:42:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43746 to 30970. [2019-12-07 17:42:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30970 states. [2019-12-07 17:42:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30970 states to 30970 states and 102029 transitions. [2019-12-07 17:42:32,401 INFO L78 Accepts]: Start accepts. Automaton has 30970 states and 102029 transitions. Word has length 22 [2019-12-07 17:42:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:32,402 INFO L462 AbstractCegarLoop]: Abstraction has 30970 states and 102029 transitions. [2019-12-07 17:42:32,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 30970 states and 102029 transitions. [2019-12-07 17:42:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:42:32,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:32,412 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 17:42:32,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-07 17:42:32,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:32,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908055189] [2019-12-07 17:42:32,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:32,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 17:42:32,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908055189] [2019-12-07 17:42:32,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:32,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:32,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156199833] [2019-12-07 17:42:32,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:32,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:32,463 INFO L87 Difference]: Start difference. First operand 30970 states and 102029 transitions. Second operand 5 states. [2019-12-07 17:42:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:32,527 INFO L93 Difference]: Finished difference Result 13561 states and 42417 transitions. [2019-12-07 17:42:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:32,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:42:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:32,542 INFO L225 Difference]: With dead ends: 13561 [2019-12-07 17:42:32,542 INFO L226 Difference]: Without dead ends: 11778 [2019-12-07 17:42:32,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11778 states. [2019-12-07 17:42:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11778 to 11778. [2019-12-07 17:42:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11778 states. [2019-12-07 17:42:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11778 states to 11778 states and 36586 transitions. [2019-12-07 17:42:32,712 INFO L78 Accepts]: Start accepts. Automaton has 11778 states and 36586 transitions. Word has length 25 [2019-12-07 17:42:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:32,712 INFO L462 AbstractCegarLoop]: Abstraction has 11778 states and 36586 transitions. [2019-12-07 17:42:32,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11778 states and 36586 transitions. [2019-12-07 17:42:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:42:32,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:32,728 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] [2019-12-07 17:42:32,728 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-07 17:42:32,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:32,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506307460] [2019-12-07 17:42:32,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:32,776 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 17:42:32,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506307460] [2019-12-07 17:42:32,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:32,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:32,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268716051] [2019-12-07 17:42:32,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:32,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:32,778 INFO L87 Difference]: Start difference. First operand 11778 states and 36586 transitions. Second operand 6 states. [2019-12-07 17:42:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:33,140 INFO L93 Difference]: Finished difference Result 16270 states and 48896 transitions. [2019-12-07 17:42:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:42:33,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 17:42:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:33,157 INFO L225 Difference]: With dead ends: 16270 [2019-12-07 17:42:33,158 INFO L226 Difference]: Without dead ends: 16268 [2019-12-07 17:42:33,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:42:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16268 states. [2019-12-07 17:42:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16268 to 13199. [2019-12-07 17:42:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13199 states. [2019-12-07 17:42:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 40589 transitions. [2019-12-07 17:42:33,369 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 40589 transitions. Word has length 40 [2019-12-07 17:42:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:33,370 INFO L462 AbstractCegarLoop]: Abstraction has 13199 states and 40589 transitions. [2019-12-07 17:42:33,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 40589 transitions. [2019-12-07 17:42:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:42:33,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:33,387 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] [2019-12-07 17:42:33,387 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2063605447, now seen corresponding path program 1 times [2019-12-07 17:42:33,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:33,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619722962] [2019-12-07 17:42:33,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:33,415 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 17:42:33,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619722962] [2019-12-07 17:42:33,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:33,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:33,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97613325] [2019-12-07 17:42:33,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:33,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:33,417 INFO L87 Difference]: Start difference. First operand 13199 states and 40589 transitions. Second operand 3 states. [2019-12-07 17:42:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:33,471 INFO L93 Difference]: Finished difference Result 15700 states and 46986 transitions. [2019-12-07 17:42:33,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:33,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 17:42:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:33,489 INFO L225 Difference]: With dead ends: 15700 [2019-12-07 17:42:33,489 INFO L226 Difference]: Without dead ends: 15700 [2019-12-07 17:42:33,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15700 states. [2019-12-07 17:42:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15700 to 13748. [2019-12-07 17:42:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13748 states. [2019-12-07 17:42:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13748 states to 13748 states and 41502 transitions. [2019-12-07 17:42:33,696 INFO L78 Accepts]: Start accepts. Automaton has 13748 states and 41502 transitions. Word has length 40 [2019-12-07 17:42:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:33,697 INFO L462 AbstractCegarLoop]: Abstraction has 13748 states and 41502 transitions. [2019-12-07 17:42:33,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 13748 states and 41502 transitions. [2019-12-07 17:42:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:42:33,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:33,716 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] [2019-12-07 17:42:33,716 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash 528554666, now seen corresponding path program 1 times [2019-12-07 17:42:33,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:33,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597409197] [2019-12-07 17:42:33,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:33,763 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 17:42:33,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597409197] [2019-12-07 17:42:33,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:33,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:33,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314147283] [2019-12-07 17:42:33,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:33,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:33,764 INFO L87 Difference]: Start difference. First operand 13748 states and 41502 transitions. Second operand 5 states. [2019-12-07 17:42:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:34,082 INFO L93 Difference]: Finished difference Result 20619 states and 61584 transitions. [2019-12-07 17:42:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:34,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 17:42:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:34,103 INFO L225 Difference]: With dead ends: 20619 [2019-12-07 17:42:34,103 INFO L226 Difference]: Without dead ends: 20619 [2019-12-07 17:42:34,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 17:42:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20619 states. [2019-12-07 17:42:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20619 to 17526. [2019-12-07 17:42:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17526 states. [2019-12-07 17:42:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17526 states to 17526 states and 52966 transitions. [2019-12-07 17:42:34,365 INFO L78 Accepts]: Start accepts. Automaton has 17526 states and 52966 transitions. Word has length 40 [2019-12-07 17:42:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:34,366 INFO L462 AbstractCegarLoop]: Abstraction has 17526 states and 52966 transitions. [2019-12-07 17:42:34,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 17526 states and 52966 transitions. [2019-12-07 17:42:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:42:34,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:34,382 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] [2019-12-07 17:42:34,382 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1510494422, now seen corresponding path program 2 times [2019-12-07 17:42:34,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:34,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60723816] [2019-12-07 17:42:34,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:34,438 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 17:42:34,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60723816] [2019-12-07 17:42:34,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:34,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:34,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259737167] [2019-12-07 17:42:34,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:34,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:34,439 INFO L87 Difference]: Start difference. First operand 17526 states and 52966 transitions. Second operand 3 states. [2019-12-07 17:42:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:34,526 INFO L93 Difference]: Finished difference Result 31326 states and 94682 transitions. [2019-12-07 17:42:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:34,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 17:42:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:34,564 INFO L225 Difference]: With dead ends: 31326 [2019-12-07 17:42:34,564 INFO L226 Difference]: Without dead ends: 29694 [2019-12-07 17:42:34,564 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 17:42:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29694 states. [2019-12-07 17:42:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29694 to 29464. [2019-12-07 17:42:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29464 states. [2019-12-07 17:42:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29464 states to 29464 states and 89269 transitions. [2019-12-07 17:42:35,197 INFO L78 Accepts]: Start accepts. Automaton has 29464 states and 89269 transitions. Word has length 40 [2019-12-07 17:42:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:35,198 INFO L462 AbstractCegarLoop]: Abstraction has 29464 states and 89269 transitions. [2019-12-07 17:42:35,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29464 states and 89269 transitions. [2019-12-07 17:42:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:42:35,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:35,228 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] [2019-12-07 17:42:35,228 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-07 17:42:35,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:35,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643100861] [2019-12-07 17:42:35,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:35,291 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 17:42:35,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643100861] [2019-12-07 17:42:35,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:35,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:35,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200279584] [2019-12-07 17:42:35,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:35,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:35,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:35,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:35,293 INFO L87 Difference]: Start difference. First operand 29464 states and 89269 transitions. Second operand 6 states. [2019-12-07 17:42:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:35,731 INFO L93 Difference]: Finished difference Result 34434 states and 102492 transitions. [2019-12-07 17:42:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:42:35,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 17:42:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:35,772 INFO L225 Difference]: With dead ends: 34434 [2019-12-07 17:42:35,772 INFO L226 Difference]: Without dead ends: 34362 [2019-12-07 17:42:35,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:42:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34362 states. [2019-12-07 17:42:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34362 to 28242. [2019-12-07 17:42:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28242 states. [2019-12-07 17:42:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28242 states to 28242 states and 85713 transitions. [2019-12-07 17:42:36,243 INFO L78 Accepts]: Start accepts. Automaton has 28242 states and 85713 transitions. Word has length 41 [2019-12-07 17:42:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:36,243 INFO L462 AbstractCegarLoop]: Abstraction has 28242 states and 85713 transitions. [2019-12-07 17:42:36,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28242 states and 85713 transitions. [2019-12-07 17:42:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:42:36,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:36,273 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] [2019-12-07 17:42:36,274 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 1 times [2019-12-07 17:42:36,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:36,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611336614] [2019-12-07 17:42:36,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:36,315 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 17:42:36,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611336614] [2019-12-07 17:42:36,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:36,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:36,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187610418] [2019-12-07 17:42:36,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:36,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:36,316 INFO L87 Difference]: Start difference. First operand 28242 states and 85713 transitions. Second operand 3 states. [2019-12-07 17:42:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:36,400 INFO L93 Difference]: Finished difference Result 26853 states and 80234 transitions. [2019-12-07 17:42:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:36,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 17:42:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:36,435 INFO L225 Difference]: With dead ends: 26853 [2019-12-07 17:42:36,435 INFO L226 Difference]: Without dead ends: 26853 [2019-12-07 17:42:36,436 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 17:42:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26853 states. [2019-12-07 17:42:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26853 to 25778. [2019-12-07 17:42:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25778 states. [2019-12-07 17:42:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25778 states to 25778 states and 77197 transitions. [2019-12-07 17:42:36,831 INFO L78 Accepts]: Start accepts. Automaton has 25778 states and 77197 transitions. Word has length 41 [2019-12-07 17:42:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:36,832 INFO L462 AbstractCegarLoop]: Abstraction has 25778 states and 77197 transitions. [2019-12-07 17:42:36,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25778 states and 77197 transitions. [2019-12-07 17:42:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:42:36,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:36,857 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] [2019-12-07 17:42:36,858 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 838446510, now seen corresponding path program 1 times [2019-12-07 17:42:36,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:36,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745060832] [2019-12-07 17:42:36,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:36,921 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 17:42:36,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745060832] [2019-12-07 17:42:36,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:36,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:36,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108264876] [2019-12-07 17:42:36,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:36,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:36,923 INFO L87 Difference]: Start difference. First operand 25778 states and 77197 transitions. Second operand 6 states. [2019-12-07 17:42:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:37,026 INFO L93 Difference]: Finished difference Result 23874 states and 72814 transitions. [2019-12-07 17:42:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:37,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 17:42:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:37,052 INFO L225 Difference]: With dead ends: 23874 [2019-12-07 17:42:37,052 INFO L226 Difference]: Without dead ends: 23479 [2019-12-07 17:42:37,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:42:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23479 states. [2019-12-07 17:42:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23479 to 12933. [2019-12-07 17:42:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12933 states. [2019-12-07 17:42:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12933 states to 12933 states and 39638 transitions. [2019-12-07 17:42:37,303 INFO L78 Accepts]: Start accepts. Automaton has 12933 states and 39638 transitions. Word has length 42 [2019-12-07 17:42:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:37,304 INFO L462 AbstractCegarLoop]: Abstraction has 12933 states and 39638 transitions. [2019-12-07 17:42:37,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 12933 states and 39638 transitions. [2019-12-07 17:42:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:42:37,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:37,316 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] [2019-12-07 17:42:37,316 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash -944534763, now seen corresponding path program 1 times [2019-12-07 17:42:37,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:37,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468266114] [2019-12-07 17:42:37,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:37,358 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 17:42:37,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468266114] [2019-12-07 17:42:37,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:37,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:37,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337126495] [2019-12-07 17:42:37,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:37,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:37,360 INFO L87 Difference]: Start difference. First operand 12933 states and 39638 transitions. Second operand 3 states. [2019-12-07 17:42:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:37,421 INFO L93 Difference]: Finished difference Result 23381 states and 71654 transitions. [2019-12-07 17:42:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:37,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 17:42:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:37,432 INFO L225 Difference]: With dead ends: 23381 [2019-12-07 17:42:37,432 INFO L226 Difference]: Without dead ends: 10896 [2019-12-07 17:42:37,432 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 17:42:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10896 states. [2019-12-07 17:42:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10896 to 10896. [2019-12-07 17:42:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10896 states. [2019-12-07 17:42:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10896 states to 10896 states and 33225 transitions. [2019-12-07 17:42:37,584 INFO L78 Accepts]: Start accepts. Automaton has 10896 states and 33225 transitions. Word has length 56 [2019-12-07 17:42:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:37,584 INFO L462 AbstractCegarLoop]: Abstraction has 10896 states and 33225 transitions. [2019-12-07 17:42:37,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 10896 states and 33225 transitions. [2019-12-07 17:42:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:42:37,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:37,594 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] [2019-12-07 17:42:37,594 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 2 times [2019-12-07 17:42:37,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:37,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769852358] [2019-12-07 17:42:37,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:37,896 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 17:42:37,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769852358] [2019-12-07 17:42:37,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:37,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:42:37,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051226182] [2019-12-07 17:42:37,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:42:37,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:42:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:42:37,897 INFO L87 Difference]: Start difference. First operand 10896 states and 33225 transitions. Second operand 15 states. [2019-12-07 17:42:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:43,699 INFO L93 Difference]: Finished difference Result 34990 states and 105592 transitions. [2019-12-07 17:42:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-07 17:42:43,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 17:42:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:43,731 INFO L225 Difference]: With dead ends: 34990 [2019-12-07 17:42:43,731 INFO L226 Difference]: Without dead ends: 21838 [2019-12-07 17:42:43,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=963, Invalid=5679, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 17:42:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21838 states. [2019-12-07 17:42:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21838 to 13011. [2019-12-07 17:42:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13011 states. [2019-12-07 17:42:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13011 states to 13011 states and 39544 transitions. [2019-12-07 17:42:43,984 INFO L78 Accepts]: Start accepts. Automaton has 13011 states and 39544 transitions. Word has length 56 [2019-12-07 17:42:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:43,985 INFO L462 AbstractCegarLoop]: Abstraction has 13011 states and 39544 transitions. [2019-12-07 17:42:43,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:42:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13011 states and 39544 transitions. [2019-12-07 17:42:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:42:43,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:43,998 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] [2019-12-07 17:42:43,998 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666311, now seen corresponding path program 3 times [2019-12-07 17:42:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:43,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394126673] [2019-12-07 17:42:43,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:44,313 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 17:42:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394126673] [2019-12-07 17:42:44,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:44,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:42:44,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488456007] [2019-12-07 17:42:44,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:42:44,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:42:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:42:44,314 INFO L87 Difference]: Start difference. First operand 13011 states and 39544 transitions. Second operand 16 states. [2019-12-07 17:42:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:50,141 INFO L93 Difference]: Finished difference Result 25865 states and 76867 transitions. [2019-12-07 17:42:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 17:42:50,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:42:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:50,163 INFO L225 Difference]: With dead ends: 25865 [2019-12-07 17:42:50,163 INFO L226 Difference]: Without dead ends: 19366 [2019-12-07 17:42:50,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=536, Invalid=2434, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 17:42:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2019-12-07 17:42:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 13547. [2019-12-07 17:42:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13547 states. [2019-12-07 17:42:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13547 states to 13547 states and 41067 transitions. [2019-12-07 17:42:50,403 INFO L78 Accepts]: Start accepts. Automaton has 13547 states and 41067 transitions. Word has length 56 [2019-12-07 17:42:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:50,403 INFO L462 AbstractCegarLoop]: Abstraction has 13547 states and 41067 transitions. [2019-12-07 17:42:50,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:42:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13547 states and 41067 transitions. [2019-12-07 17:42:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:42:50,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:50,416 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] [2019-12-07 17:42:50,416 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash -337997383, now seen corresponding path program 4 times [2019-12-07 17:42:50,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:50,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756739436] [2019-12-07 17:42:50,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:50,707 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 17:42:50,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756739436] [2019-12-07 17:42:50,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:50,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:42:50,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414202799] [2019-12-07 17:42:50,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:42:50,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:42:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:42:50,708 INFO L87 Difference]: Start difference. First operand 13547 states and 41067 transitions. Second operand 15 states. [2019-12-07 17:42:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:55,744 INFO L93 Difference]: Finished difference Result 31950 states and 95552 transitions. [2019-12-07 17:42:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 17:42:55,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 17:42:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:55,769 INFO L225 Difference]: With dead ends: 31950 [2019-12-07 17:42:55,769 INFO L226 Difference]: Without dead ends: 22406 [2019-12-07 17:42:55,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=963, Invalid=5043, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 17:42:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22406 states. [2019-12-07 17:42:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22406 to 13479. [2019-12-07 17:42:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13479 states. [2019-12-07 17:42:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13479 states to 13479 states and 40655 transitions. [2019-12-07 17:42:56,029 INFO L78 Accepts]: Start accepts. Automaton has 13479 states and 40655 transitions. Word has length 56 [2019-12-07 17:42:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:56,029 INFO L462 AbstractCegarLoop]: Abstraction has 13479 states and 40655 transitions. [2019-12-07 17:42:56,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:42:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13479 states and 40655 transitions. [2019-12-07 17:42:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:42:56,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:56,048 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] [2019-12-07 17:42:56,048 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 93841739, now seen corresponding path program 5 times [2019-12-07 17:42:56,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:56,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992856887] [2019-12-07 17:42:56,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:56,354 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 17:42:56,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992856887] [2019-12-07 17:42:56,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:56,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:42:56,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927073863] [2019-12-07 17:42:56,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:42:56,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:42:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:42:56,355 INFO L87 Difference]: Start difference. First operand 13479 states and 40655 transitions. Second operand 16 states. [2019-12-07 17:42:58,739 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 17:43:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:02,339 INFO L93 Difference]: Finished difference Result 24536 states and 73397 transitions. [2019-12-07 17:43:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-07 17:43:02,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:43:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:02,364 INFO L225 Difference]: With dead ends: 24536 [2019-12-07 17:43:02,364 INFO L226 Difference]: Without dead ends: 22348 [2019-12-07 17:43:02,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=907, Invalid=4793, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 17:43:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22348 states. [2019-12-07 17:43:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22348 to 13457. [2019-12-07 17:43:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13457 states. [2019-12-07 17:43:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13457 states to 13457 states and 40573 transitions. [2019-12-07 17:43:02,626 INFO L78 Accepts]: Start accepts. Automaton has 13457 states and 40573 transitions. Word has length 56 [2019-12-07 17:43:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:02,626 INFO L462 AbstractCegarLoop]: Abstraction has 13457 states and 40573 transitions. [2019-12-07 17:43:02,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:43:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13457 states and 40573 transitions. [2019-12-07 17:43:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:43:02,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:02,639 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] [2019-12-07 17:43:02,639 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1355287643, now seen corresponding path program 6 times [2019-12-07 17:43:02,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:02,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152291842] [2019-12-07 17:43:02,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:02,753 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 17:43:02,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152291842] [2019-12-07 17:43:02,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:43:02,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:43:02,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179451680] [2019-12-07 17:43:02,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:43:02,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:43:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:43:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:43:02,754 INFO L87 Difference]: Start difference. First operand 13457 states and 40573 transitions. Second operand 10 states. [2019-12-07 17:43:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:03,448 INFO L93 Difference]: Finished difference Result 20698 states and 62374 transitions. [2019-12-07 17:43:03,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:43:03,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 17:43:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:03,466 INFO L225 Difference]: With dead ends: 20698 [2019-12-07 17:43:03,466 INFO L226 Difference]: Without dead ends: 16366 [2019-12-07 17:43:03,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:43:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16366 states. [2019-12-07 17:43:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16366 to 13812. [2019-12-07 17:43:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2019-12-07 17:43:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 41574 transitions. [2019-12-07 17:43:03,680 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 41574 transitions. Word has length 56 [2019-12-07 17:43:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:03,680 INFO L462 AbstractCegarLoop]: Abstraction has 13812 states and 41574 transitions. [2019-12-07 17:43:03,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:43:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 41574 transitions. [2019-12-07 17:43:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:43:03,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:03,693 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] [2019-12-07 17:43:03,693 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -671010529, now seen corresponding path program 7 times [2019-12-07 17:43:03,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:03,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911986555] [2019-12-07 17:43:03,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:03,839 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 17:43:03,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911986555] [2019-12-07 17:43:03,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:43:03,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:43:03,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058531804] [2019-12-07 17:43:03,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:43:03,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:43:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:43:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:43:03,840 INFO L87 Difference]: Start difference. First operand 13812 states and 41574 transitions. Second operand 11 states. [2019-12-07 17:43:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:04,555 INFO L93 Difference]: Finished difference Result 18458 states and 55116 transitions. [2019-12-07 17:43:04,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:43:04,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:43:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:04,572 INFO L225 Difference]: With dead ends: 18458 [2019-12-07 17:43:04,572 INFO L226 Difference]: Without dead ends: 16089 [2019-12-07 17:43:04,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:43:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2019-12-07 17:43:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 13687. [2019-12-07 17:43:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13687 states. [2019-12-07 17:43:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 41204 transitions. [2019-12-07 17:43:04,782 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 41204 transitions. Word has length 56 [2019-12-07 17:43:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:04,782 INFO L462 AbstractCegarLoop]: Abstraction has 13687 states and 41204 transitions. [2019-12-07 17:43:04,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:43:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 41204 transitions. [2019-12-07 17:43:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:43:04,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:04,795 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] [2019-12-07 17:43:04,795 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1406091659, now seen corresponding path program 8 times [2019-12-07 17:43:04,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:04,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470115414] [2019-12-07 17:43:04,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:04,899 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 17:43:04,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470115414] [2019-12-07 17:43:04,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:43:04,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:43:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414341457] [2019-12-07 17:43:04,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:43:04,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:43:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:43:04,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:43:04,900 INFO L87 Difference]: Start difference. First operand 13687 states and 41204 transitions. Second operand 11 states. [2019-12-07 17:43:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:05,605 INFO L93 Difference]: Finished difference Result 28403 states and 85255 transitions. [2019-12-07 17:43:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:43:05,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:43:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:05,628 INFO L225 Difference]: With dead ends: 28403 [2019-12-07 17:43:05,628 INFO L226 Difference]: Without dead ends: 20758 [2019-12-07 17:43:05,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:43:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20758 states. [2019-12-07 17:43:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20758 to 13133. [2019-12-07 17:43:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13133 states. [2019-12-07 17:43:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13133 states to 13133 states and 39482 transitions. [2019-12-07 17:43:05,869 INFO L78 Accepts]: Start accepts. Automaton has 13133 states and 39482 transitions. Word has length 56 [2019-12-07 17:43:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:05,869 INFO L462 AbstractCegarLoop]: Abstraction has 13133 states and 39482 transitions. [2019-12-07 17:43:05,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:43:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13133 states and 39482 transitions. [2019-12-07 17:43:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:43:05,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:05,881 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] [2019-12-07 17:43:05,881 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 9 times [2019-12-07 17:43:05,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:05,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891492053] [2019-12-07 17:43:05,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:43:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:43:05,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:43:05,945 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:43:05,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30| 1)) (= |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_30|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30|) |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30|)) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| 4) |v_#length_23|) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_31|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:43:05,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-07 17:43:05,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:43:05,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:43:05,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-331684563 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-331684563 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-331684563| ~x~0_In-331684563)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-331684563| ~x$w_buff1~0_In-331684563) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-331684563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-331684563, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-331684563, ~x~0=~x~0_In-331684563} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-331684563|, ~x$w_buff1~0=~x$w_buff1~0_In-331684563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-331684563, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-331684563, ~x~0=~x~0_In-331684563} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:43:05,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:43:05,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-2144463238 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2144463238 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-2144463238| ~x$w_buff0_used~0_In-2144463238) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-2144463238| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2144463238|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:43:05,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In990220539 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In990220539 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In990220539 |P1Thread1of1ForFork0_#t~ite28_Out990220539|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out990220539|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In990220539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990220539} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In990220539, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out990220539|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990220539} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:43:05,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1041582028 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1041582028 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1041582028 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1041582028 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1041582028| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1041582028| ~x$w_buff1_used~0_In1041582028) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1041582028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1041582028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1041582028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041582028} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1041582028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1041582028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1041582028, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1041582028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041582028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:43:05,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In360435610 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In360435610 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out360435610 ~x$r_buff0_thd2~0_In360435610))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out360435610 0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out360435610|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:43:05,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In195134002 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In195134002 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In195134002 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In195134002 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out195134002| ~x$r_buff1_thd2~0_In195134002)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out195134002| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In195134002, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In195134002, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out195134002|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195134002, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In195134002, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:43:05,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:43:05,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-519157429 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-519157429| |P0Thread1of1ForFork2_#t~ite8_Out-519157429|) (not .cse0) (= ~x$w_buff0~0_In-519157429 |P0Thread1of1ForFork2_#t~ite9_Out-519157429|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-519157429 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-519157429 256))) (= (mod ~x$w_buff0_used~0_In-519157429 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-519157429 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-519157429| ~x$w_buff0~0_In-519157429) (= |P0Thread1of1ForFork2_#t~ite8_Out-519157429| |P0Thread1of1ForFork2_#t~ite9_Out-519157429|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-519157429, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519157429, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519157429, ~weak$$choice2~0=~weak$$choice2~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-519157429, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519157429, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-519157429|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519157429, ~weak$$choice2~0=~weak$$choice2~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 17:43:05,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1660626224 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1660626224 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1660626224 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1660626224 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1660626224 |P2Thread1of1ForFork1_#t~ite35_Out-1660626224|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1660626224|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1660626224, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1660626224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660626224} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1660626224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1660626224, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1660626224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660626224} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:43:05,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1549032800 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1549032800 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1549032800| ~x$r_buff0_thd3~0_In-1549032800) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1549032800| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1549032800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1549032800} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1549032800|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1549032800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1549032800} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:43:05,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-851888520 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-851888520 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-851888520 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-851888520 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-851888520| ~x$r_buff1_thd3~0_In-851888520) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-851888520|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-851888520, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-851888520, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-851888520|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-851888520, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-851888520, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:43:05,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:43:05,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-666659355 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out-666659355| ~x$w_buff1_used~0_In-666659355) (= |P0Thread1of1ForFork2_#t~ite17_In-666659355| |P0Thread1of1ForFork2_#t~ite17_Out-666659355|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out-666659355| |P0Thread1of1ForFork2_#t~ite18_Out-666659355|) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out-666659355| ~x$w_buff1_used~0_In-666659355) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-666659355 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-666659355 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-666659355 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-666659355 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-666659355, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-666659355|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-666659355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-666659355, ~weak$$choice2~0=~weak$$choice2~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-666659355, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-666659355|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-666659355|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-666659355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-666659355, ~weak$$choice2~0=~weak$$choice2~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 17:43:05,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:43:05,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1135088665 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1135088665| ~x$r_buff1_thd1~0_In-1135088665) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1135088665| |P0Thread1of1ForFork2_#t~ite23_Out-1135088665|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1135088665 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1135088665 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1135088665 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1135088665 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1135088665| |P0Thread1of1ForFork2_#t~ite23_Out-1135088665|) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-1135088665| ~x$r_buff1_thd1~0_In-1135088665)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1135088665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135088665, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1135088665, ~weak$$choice2~0=~weak$$choice2~0_In-1135088665, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1135088665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135088665} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1135088665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135088665, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1135088665, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1135088665|, ~weak$$choice2~0=~weak$$choice2~0_In-1135088665, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1135088665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135088665} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 17:43:05,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:43:05,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:43:05,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1538098250 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1538098250 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1538098250 |ULTIMATE.start_main_#t~ite41_Out-1538098250|) (not .cse1)) (and (= ~x~0_In-1538098250 |ULTIMATE.start_main_#t~ite41_Out-1538098250|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1538098250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1538098250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1538098250, ~x~0=~x~0_In-1538098250} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1538098250|, ~x$w_buff1~0=~x$w_buff1~0_In-1538098250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1538098250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1538098250, ~x~0=~x~0_In-1538098250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:43:05,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:43:05,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In841900933 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In841900933 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out841900933|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out841900933| ~x$w_buff0_used~0_In841900933)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In841900933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841900933} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In841900933, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out841900933|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841900933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:43:05,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2028015811 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2028015811 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2028015811 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In2028015811 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2028015811 |ULTIMATE.start_main_#t~ite44_Out2028015811|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2028015811|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2028015811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2028015811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2028015811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028015811} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2028015811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2028015811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2028015811, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2028015811|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028015811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:43:05,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-850412493 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-850412493 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-850412493| ~x$r_buff0_thd0~0_In-850412493) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-850412493|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-850412493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:43:05,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In94998390 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In94998390 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In94998390 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In94998390 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out94998390|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In94998390 |ULTIMATE.start_main_#t~ite46_Out94998390|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In94998390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In94998390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In94998390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94998390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In94998390, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out94998390|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In94998390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In94998390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94998390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:43:05,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:43:06,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:43:06 BasicIcfg [2019-12-07 17:43:06,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:43:06,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:43:06,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:43:06,006 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:43:06,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:14" (3/4) ... [2019-12-07 17:43:06,008 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:43:06,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30| 1)) (= |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_30|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30|) |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30|)) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| 4) |v_#length_23|) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_31|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:43:06,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-07 17:43:06,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:43:06,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:43:06,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-331684563 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-331684563 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-331684563| ~x~0_In-331684563)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-331684563| ~x$w_buff1~0_In-331684563) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-331684563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-331684563, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-331684563, ~x~0=~x~0_In-331684563} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-331684563|, ~x$w_buff1~0=~x$w_buff1~0_In-331684563, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-331684563, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-331684563, ~x~0=~x~0_In-331684563} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:43:06,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:43:06,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-2144463238 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2144463238 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-2144463238| ~x$w_buff0_used~0_In-2144463238) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-2144463238| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2144463238|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:43:06,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In990220539 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In990220539 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In990220539 |P1Thread1of1ForFork0_#t~ite28_Out990220539|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out990220539|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In990220539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990220539} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In990220539, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out990220539|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990220539} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:43:06,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1041582028 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1041582028 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1041582028 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1041582028 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1041582028| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1041582028| ~x$w_buff1_used~0_In1041582028) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1041582028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1041582028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1041582028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041582028} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1041582028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1041582028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1041582028, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1041582028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041582028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:43:06,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In360435610 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In360435610 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out360435610 ~x$r_buff0_thd2~0_In360435610))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out360435610 0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out360435610|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:43:06,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In195134002 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In195134002 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In195134002 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In195134002 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out195134002| ~x$r_buff1_thd2~0_In195134002)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out195134002| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In195134002, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In195134002, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out195134002|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195134002, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In195134002, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:43:06,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:43:06,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-519157429 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-519157429| |P0Thread1of1ForFork2_#t~ite8_Out-519157429|) (not .cse0) (= ~x$w_buff0~0_In-519157429 |P0Thread1of1ForFork2_#t~ite9_Out-519157429|)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-519157429 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-519157429 256))) (= (mod ~x$w_buff0_used~0_In-519157429 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-519157429 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-519157429| ~x$w_buff0~0_In-519157429) (= |P0Thread1of1ForFork2_#t~ite8_Out-519157429| |P0Thread1of1ForFork2_#t~ite9_Out-519157429|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-519157429, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519157429, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519157429, ~weak$$choice2~0=~weak$$choice2~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-519157429, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-519157429, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-519157429|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-519157429, ~weak$$choice2~0=~weak$$choice2~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 17:43:06,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1660626224 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1660626224 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1660626224 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1660626224 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1660626224 |P2Thread1of1ForFork1_#t~ite35_Out-1660626224|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1660626224|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1660626224, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1660626224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660626224} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1660626224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1660626224, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1660626224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660626224} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:43:06,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1549032800 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1549032800 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1549032800| ~x$r_buff0_thd3~0_In-1549032800) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1549032800| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1549032800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1549032800} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1549032800|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1549032800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1549032800} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:43:06,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-851888520 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-851888520 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-851888520 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-851888520 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-851888520| ~x$r_buff1_thd3~0_In-851888520) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-851888520|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-851888520, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-851888520, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-851888520|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-851888520, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-851888520, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:43:06,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:43:06,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-666659355 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out-666659355| ~x$w_buff1_used~0_In-666659355) (= |P0Thread1of1ForFork2_#t~ite17_In-666659355| |P0Thread1of1ForFork2_#t~ite17_Out-666659355|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out-666659355| |P0Thread1of1ForFork2_#t~ite18_Out-666659355|) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out-666659355| ~x$w_buff1_used~0_In-666659355) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-666659355 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-666659355 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-666659355 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-666659355 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-666659355, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-666659355|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-666659355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-666659355, ~weak$$choice2~0=~weak$$choice2~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-666659355, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-666659355|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-666659355|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-666659355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-666659355, ~weak$$choice2~0=~weak$$choice2~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 17:43:06,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1135088665 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1135088665| ~x$r_buff1_thd1~0_In-1135088665) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1135088665| |P0Thread1of1ForFork2_#t~ite23_Out-1135088665|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1135088665 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1135088665 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1135088665 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1135088665 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1135088665| |P0Thread1of1ForFork2_#t~ite23_Out-1135088665|) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-1135088665| ~x$r_buff1_thd1~0_In-1135088665)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1135088665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135088665, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1135088665, ~weak$$choice2~0=~weak$$choice2~0_In-1135088665, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1135088665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135088665} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1135088665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135088665, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1135088665, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1135088665|, ~weak$$choice2~0=~weak$$choice2~0_In-1135088665, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1135088665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135088665} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1538098250 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1538098250 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1538098250 |ULTIMATE.start_main_#t~ite41_Out-1538098250|) (not .cse1)) (and (= ~x~0_In-1538098250 |ULTIMATE.start_main_#t~ite41_Out-1538098250|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1538098250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1538098250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1538098250, ~x~0=~x~0_In-1538098250} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1538098250|, ~x$w_buff1~0=~x$w_buff1~0_In-1538098250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1538098250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1538098250, ~x~0=~x~0_In-1538098250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:43:06,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In841900933 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In841900933 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out841900933|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out841900933| ~x$w_buff0_used~0_In841900933)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In841900933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841900933} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In841900933, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out841900933|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841900933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:43:06,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2028015811 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2028015811 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2028015811 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In2028015811 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2028015811 |ULTIMATE.start_main_#t~ite44_Out2028015811|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2028015811|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2028015811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2028015811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2028015811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028015811} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2028015811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2028015811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2028015811, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2028015811|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028015811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:43:06,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-850412493 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-850412493 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-850412493| ~x$r_buff0_thd0~0_In-850412493) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-850412493|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-850412493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:43:06,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In94998390 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In94998390 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In94998390 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In94998390 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out94998390|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In94998390 |ULTIMATE.start_main_#t~ite46_Out94998390|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In94998390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In94998390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In94998390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94998390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In94998390, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out94998390|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In94998390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In94998390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In94998390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:43:06,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:43:06,066 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f136ac6a-e53d-415b-8efa-74551f37f2d6/bin/uautomizer/witness.graphml [2019-12-07 17:43:06,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:43:06,067 INFO L168 Benchmark]: Toolchain (without parser) took 112614.57 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 940.9 MB in the beginning and 4.0 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:43:06,067 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:43:06,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:43:06,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.67 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 17:43:06,068 INFO L168 Benchmark]: Boogie Preprocessor took 28.34 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 17:43:06,068 INFO L168 Benchmark]: RCFGBuilder took 384.28 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:43:06,069 INFO L168 Benchmark]: TraceAbstraction took 111713.27 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:43:06,069 INFO L168 Benchmark]: Witness Printer took 60.78 ms. Allocated memory is still 7.0 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:43:06,070 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.67 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 28.34 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 384.28 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111713.27 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 60.78 ms. Allocated memory is still 7.0 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5206 SDtfs, 8946 SDslu, 19576 SDs, 0 SdLazy, 18619 SolverSat, 631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 28 SyntacticMatches, 24 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7482 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 210427 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 966 NumberOfCodeBlocks, 966 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 884 ConstructedInterpolants, 0 QuantifiedInterpolants, 213017 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...