./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/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 5bea2620cbf7d9802cade400ab179fe4d1d2fa3f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:50:08,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:50:08,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:50:08,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:50:08,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:50:08,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:50:08,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:50:08,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:50:08,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:50:08,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:50:08,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:50:08,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:50:08,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:50:08,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:50:08,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:50:08,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:50:08,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:50:08,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:50:08,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:50:08,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:50:08,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:50:08,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:50:08,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:50:08,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:50:08,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:50:08,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:50:08,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:50:08,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:50:08,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:50:08,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:50:08,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:50:08,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:50:08,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:50:08,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:50:08,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:50:08,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:50:08,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:50:08,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:50:08,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:50:08,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:50:08,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:50:08,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:50:08,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:50:08,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:50:08,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:50:08,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:50:08,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:50:08,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:50:08,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:50:08,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:50:08,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:50:08,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:50:08,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:50:08,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:50:08,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:50:08,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:50:08,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:50:08,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:50:08,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:50:08,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:50:08,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:50:08,832 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_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/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 -> 5bea2620cbf7d9802cade400ab179fe4d1d2fa3f [2019-12-07 17:50:08,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:50:08,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:50:08,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:50:08,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:50:08,941 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:50:08,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt.i [2019-12-07 17:50:08,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/data/68715f55e/0fc4a26e961f4b9bbca7c3345b06a1ae/FLAGf19fceb26 [2019-12-07 17:50:09,387 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:50:09,388 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/sv-benchmarks/c/pthread-wmm/mix017_pso.opt.i [2019-12-07 17:50:09,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/data/68715f55e/0fc4a26e961f4b9bbca7c3345b06a1ae/FLAGf19fceb26 [2019-12-07 17:50:09,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/data/68715f55e/0fc4a26e961f4b9bbca7c3345b06a1ae [2019-12-07 17:50:09,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:50:09,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:50:09,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:50:09,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:50:09,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:50:09,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09, skipping insertion in model container [2019-12-07 17:50:09,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:50:09,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:50:09,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:50:09,720 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:50:09,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:50:09,812 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:50:09,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09 WrapperNode [2019-12-07 17:50:09,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:50:09,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:50:09,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:50:09,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:50:09,818 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:50:09" (1/1) ... [2019-12-07 17:50:09,832 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:50:09" (1/1) ... [2019-12-07 17:50:09,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:50:09,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:50:09,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:50:09,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:50:09,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... [2019-12-07 17:50:09,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:50:09,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:50:09,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:50:09,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:50:09,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/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:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:50:09,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:50:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:50:09,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:50:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:50:09,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:50:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:50:09,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:50:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:50:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:50:09,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:50:09,933 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:50:10,341 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:50:10,341 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:50:10,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:10 BoogieIcfgContainer [2019-12-07 17:50:10,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:50:10,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:50:10,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:50:10,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:50:10,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:50:09" (1/3) ... [2019-12-07 17:50:10,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ca4946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:50:10, skipping insertion in model container [2019-12-07 17:50:10,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:50:09" (2/3) ... [2019-12-07 17:50:10,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ca4946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:50:10, skipping insertion in model container [2019-12-07 17:50:10,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:10" (3/3) ... [2019-12-07 17:50:10,346 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt.i [2019-12-07 17:50:10,352 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:50:10,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:50:10,357 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:50:10,358 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,399 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,400 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,401 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:50:10,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:50:10,435 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:50:10,435 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:50:10,435 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:50:10,435 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:50:10,435 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:50:10,435 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:50:10,435 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:50:10,435 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:50:10,447 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 17:50:10,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 17:50:10,515 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 17:50:10,515 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:50:10,527 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 943 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:50:10,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 17:50:10,590 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 17:50:10,590 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:50:10,598 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 943 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:50:10,624 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:50:10,625 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:50:14,066 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 17:50:14,254 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 17:50:14,372 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128453 [2019-12-07 17:50:14,372 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 17:50:14,375 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 133 transitions [2019-12-07 17:50:22,668 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92694 states. [2019-12-07 17:50:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 92694 states. [2019-12-07 17:50:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:50:22,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:22,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:22,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 289800420, now seen corresponding path program 1 times [2019-12-07 17:50:22,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:22,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533351025] [2019-12-07 17:50:22,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:22,838 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:50:22,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533351025] [2019-12-07 17:50:22,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:22,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:50:22,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420493924] [2019-12-07 17:50:22,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:22,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:22,853 INFO L87 Difference]: Start difference. First operand 92694 states. Second operand 3 states. [2019-12-07 17:50:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:23,574 INFO L93 Difference]: Finished difference Result 91926 states and 423356 transitions. [2019-12-07 17:50:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:23,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:50:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:24,085 INFO L225 Difference]: With dead ends: 91926 [2019-12-07 17:50:24,085 INFO L226 Difference]: Without dead ends: 86046 [2019-12-07 17:50:24,086 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:50:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86046 states. [2019-12-07 17:50:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86046 to 86046. [2019-12-07 17:50:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86046 states. [2019-12-07 17:50:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86046 states to 86046 states and 396028 transitions. [2019-12-07 17:50:28,843 INFO L78 Accepts]: Start accepts. Automaton has 86046 states and 396028 transitions. Word has length 9 [2019-12-07 17:50:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:28,844 INFO L462 AbstractCegarLoop]: Abstraction has 86046 states and 396028 transitions. [2019-12-07 17:50:28,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 86046 states and 396028 transitions. [2019-12-07 17:50:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:50:28,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:28,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:50:28,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2034236290, now seen corresponding path program 1 times [2019-12-07 17:50:28,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:28,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245009033] [2019-12-07 17:50:28,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:28,920 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:50:28,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245009033] [2019-12-07 17:50:28,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:28,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:28,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885127313] [2019-12-07 17:50:28,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:28,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:28,922 INFO L87 Difference]: Start difference. First operand 86046 states and 396028 transitions. Second operand 4 states. [2019-12-07 17:50:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:29,741 INFO L93 Difference]: Finished difference Result 133470 states and 593512 transitions. [2019-12-07 17:50:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:29,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:50:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:30,117 INFO L225 Difference]: With dead ends: 133470 [2019-12-07 17:50:30,117 INFO L226 Difference]: Without dead ends: 133406 [2019-12-07 17:50:30,118 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:50:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133406 states. [2019-12-07 17:50:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133406 to 130674. [2019-12-07 17:50:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130674 states. [2019-12-07 17:50:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130674 states to 130674 states and 583548 transitions. [2019-12-07 17:50:34,189 INFO L78 Accepts]: Start accepts. Automaton has 130674 states and 583548 transitions. Word has length 15 [2019-12-07 17:50:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:34,189 INFO L462 AbstractCegarLoop]: Abstraction has 130674 states and 583548 transitions. [2019-12-07 17:50:34,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 130674 states and 583548 transitions. [2019-12-07 17:50:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:50:34,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:34,195 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:50:34,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2071108343, now seen corresponding path program 1 times [2019-12-07 17:50:34,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:34,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961228066] [2019-12-07 17:50:34,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:34,484 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:50:34,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961228066] [2019-12-07 17:50:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:34,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:34,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312160590] [2019-12-07 17:50:34,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:34,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:34,485 INFO L87 Difference]: Start difference. First operand 130674 states and 583548 transitions. Second operand 4 states. [2019-12-07 17:50:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:35,374 INFO L93 Difference]: Finished difference Result 168598 states and 742916 transitions. [2019-12-07 17:50:35,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:50:35,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:50:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:35,825 INFO L225 Difference]: With dead ends: 168598 [2019-12-07 17:50:35,825 INFO L226 Difference]: Without dead ends: 168538 [2019-12-07 17:50:35,825 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:50:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168538 states. [2019-12-07 17:50:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168538 to 150690. [2019-12-07 17:50:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150690 states. [2019-12-07 17:50:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150690 states to 150690 states and 669704 transitions. [2019-12-07 17:50:42,121 INFO L78 Accepts]: Start accepts. Automaton has 150690 states and 669704 transitions. Word has length 18 [2019-12-07 17:50:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:42,121 INFO L462 AbstractCegarLoop]: Abstraction has 150690 states and 669704 transitions. [2019-12-07 17:50:42,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 150690 states and 669704 transitions. [2019-12-07 17:50:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:50:42,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:42,134 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] [2019-12-07 17:50:42,134 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1489223162, now seen corresponding path program 1 times [2019-12-07 17:50:42,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:42,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61631284] [2019-12-07 17:50:42,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:42,201 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:50:42,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61631284] [2019-12-07 17:50:42,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:42,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:50:42,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622679541] [2019-12-07 17:50:42,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:50:42,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:50:42,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:42,203 INFO L87 Difference]: Start difference. First operand 150690 states and 669704 transitions. Second operand 3 states. [2019-12-07 17:50:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:42,863 INFO L93 Difference]: Finished difference Result 148878 states and 659089 transitions. [2019-12-07 17:50:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:42,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:50:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:43,267 INFO L225 Difference]: With dead ends: 148878 [2019-12-07 17:50:43,267 INFO L226 Difference]: Without dead ends: 148878 [2019-12-07 17:50:43,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:50:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148878 states. [2019-12-07 17:50:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148878 to 148734. [2019-12-07 17:50:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148734 states. [2019-12-07 17:50:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148734 states to 148734 states and 658759 transitions. [2019-12-07 17:50:49,685 INFO L78 Accepts]: Start accepts. Automaton has 148734 states and 658759 transitions. Word has length 20 [2019-12-07 17:50:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:49,685 INFO L462 AbstractCegarLoop]: Abstraction has 148734 states and 658759 transitions. [2019-12-07 17:50:49,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:50:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 148734 states and 658759 transitions. [2019-12-07 17:50:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:50:49,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:49,696 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] [2019-12-07 17:50:49,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 370958877, now seen corresponding path program 1 times [2019-12-07 17:50:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:49,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316879250] [2019-12-07 17:50:49,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:49,754 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:50:49,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316879250] [2019-12-07 17:50:49,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:49,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:50:49,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563233542] [2019-12-07 17:50:49,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:50:49,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:49,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:50:49,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:49,755 INFO L87 Difference]: Start difference. First operand 148734 states and 658759 transitions. Second operand 4 states. [2019-12-07 17:50:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:50,402 INFO L93 Difference]: Finished difference Result 142158 states and 630924 transitions. [2019-12-07 17:50:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:50:50,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:50:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:51,152 INFO L225 Difference]: With dead ends: 142158 [2019-12-07 17:50:51,153 INFO L226 Difference]: Without dead ends: 142158 [2019-12-07 17:50:51,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:50:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142158 states. [2019-12-07 17:50:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142158 to 142158. [2019-12-07 17:50:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142158 states. [2019-12-07 17:50:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142158 states to 142158 states and 630924 transitions. [2019-12-07 17:50:55,298 INFO L78 Accepts]: Start accepts. Automaton has 142158 states and 630924 transitions. Word has length 21 [2019-12-07 17:50:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:50:55,298 INFO L462 AbstractCegarLoop]: Abstraction has 142158 states and 630924 transitions. [2019-12-07 17:50:55,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:50:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 142158 states and 630924 transitions. [2019-12-07 17:50:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:50:55,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:50:55,324 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] [2019-12-07 17:50:55,324 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:50:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:50:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1819593063, now seen corresponding path program 1 times [2019-12-07 17:50:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:50:55,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510614285] [2019-12-07 17:50:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:50:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:50:55,363 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:50:55,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510614285] [2019-12-07 17:50:55,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:50:55,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:50:55,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996897221] [2019-12-07 17:50:55,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:50:55,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:50:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:50:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:50:55,365 INFO L87 Difference]: Start difference. First operand 142158 states and 630924 transitions. Second operand 5 states. [2019-12-07 17:50:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:50:56,462 INFO L93 Difference]: Finished difference Result 167750 states and 736148 transitions. [2019-12-07 17:50:56,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:50:56,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 17:50:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:50:56,906 INFO L225 Difference]: With dead ends: 167750 [2019-12-07 17:50:56,907 INFO L226 Difference]: Without dead ends: 167638 [2019-12-07 17:50:56,907 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:50:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167638 states. [2019-12-07 17:51:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167638 to 141582. [2019-12-07 17:51:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141582 states. [2019-12-07 17:51:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141582 states to 141582 states and 628520 transitions. [2019-12-07 17:51:04,176 INFO L78 Accepts]: Start accepts. Automaton has 141582 states and 628520 transitions. Word has length 24 [2019-12-07 17:51:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:04,176 INFO L462 AbstractCegarLoop]: Abstraction has 141582 states and 628520 transitions. [2019-12-07 17:51:04,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:51:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 141582 states and 628520 transitions. [2019-12-07 17:51:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:51:04,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:04,306 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] [2019-12-07 17:51:04,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash -563130147, now seen corresponding path program 1 times [2019-12-07 17:51:04,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:04,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938561540] [2019-12-07 17:51:04,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:04,373 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:51:04,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938561540] [2019-12-07 17:51:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939472446] [2019-12-07 17:51:04,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:04,374 INFO L87 Difference]: Start difference. First operand 141582 states and 628520 transitions. Second operand 4 states. [2019-12-07 17:51:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:05,749 INFO L93 Difference]: Finished difference Result 270718 states and 1184264 transitions. [2019-12-07 17:51:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:51:05,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 17:51:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:06,517 INFO L225 Difference]: With dead ends: 270718 [2019-12-07 17:51:06,517 INFO L226 Difference]: Without dead ends: 270718 [2019-12-07 17:51:06,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270718 states. [2019-12-07 17:51:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270718 to 190510. [2019-12-07 17:51:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190510 states. [2019-12-07 17:51:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190510 states to 190510 states and 846196 transitions. [2019-12-07 17:51:12,813 INFO L78 Accepts]: Start accepts. Automaton has 190510 states and 846196 transitions. Word has length 34 [2019-12-07 17:51:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:12,813 INFO L462 AbstractCegarLoop]: Abstraction has 190510 states and 846196 transitions. [2019-12-07 17:51:12,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 190510 states and 846196 transitions. [2019-12-07 17:51:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:51:12,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:12,993 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] [2019-12-07 17:51:12,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1272161463, now seen corresponding path program 2 times [2019-12-07 17:51:12,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:12,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101636961] [2019-12-07 17:51:12,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:13,053 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:51:13,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101636961] [2019-12-07 17:51:13,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:13,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:13,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436184265] [2019-12-07 17:51:13,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:13,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:13,055 INFO L87 Difference]: Start difference. First operand 190510 states and 846196 transitions. Second operand 4 states. [2019-12-07 17:51:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:14,636 INFO L93 Difference]: Finished difference Result 206198 states and 912628 transitions. [2019-12-07 17:51:14,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:51:14,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 17:51:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:15,231 INFO L225 Difference]: With dead ends: 206198 [2019-12-07 17:51:15,231 INFO L226 Difference]: Without dead ends: 206198 [2019-12-07 17:51:15,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206198 states. [2019-12-07 17:51:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206198 to 203446. [2019-12-07 17:51:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203446 states. [2019-12-07 17:51:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203446 states to 203446 states and 900996 transitions. [2019-12-07 17:51:23,947 INFO L78 Accepts]: Start accepts. Automaton has 203446 states and 900996 transitions. Word has length 34 [2019-12-07 17:51:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:23,947 INFO L462 AbstractCegarLoop]: Abstraction has 203446 states and 900996 transitions. [2019-12-07 17:51:23,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 203446 states and 900996 transitions. [2019-12-07 17:51:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:51:24,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:24,149 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] [2019-12-07 17:51:24,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 663310173, now seen corresponding path program 3 times [2019-12-07 17:51:24,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:24,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471420364] [2019-12-07 17:51:24,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:24,190 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:51:24,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471420364] [2019-12-07 17:51:24,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:24,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:24,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265025397] [2019-12-07 17:51:24,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:24,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:24,191 INFO L87 Difference]: Start difference. First operand 203446 states and 900996 transitions. Second operand 3 states. [2019-12-07 17:51:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:25,354 INFO L93 Difference]: Finished difference Result 190930 states and 836916 transitions. [2019-12-07 17:51:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:25,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 17:51:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:25,857 INFO L225 Difference]: With dead ends: 190930 [2019-12-07 17:51:25,857 INFO L226 Difference]: Without dead ends: 190930 [2019-12-07 17:51:25,858 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:51:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190930 states. [2019-12-07 17:51:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190930 to 190202. [2019-12-07 17:51:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190202 states. [2019-12-07 17:51:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190202 states to 190202 states and 834132 transitions. [2019-12-07 17:51:31,251 INFO L78 Accepts]: Start accepts. Automaton has 190202 states and 834132 transitions. Word has length 34 [2019-12-07 17:51:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:31,251 INFO L462 AbstractCegarLoop]: Abstraction has 190202 states and 834132 transitions. [2019-12-07 17:51:31,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 190202 states and 834132 transitions. [2019-12-07 17:51:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:51:31,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:31,440 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] [2019-12-07 17:51:31,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1585635538, now seen corresponding path program 1 times [2019-12-07 17:51:31,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:31,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061693726] [2019-12-07 17:51:31,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:31,517 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:51:31,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061693726] [2019-12-07 17:51:31,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:31,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:51:31,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124161126] [2019-12-07 17:51:31,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:51:31,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:51:31,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:51:31,518 INFO L87 Difference]: Start difference. First operand 190202 states and 834132 transitions. Second operand 6 states. [2019-12-07 17:51:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:33,467 INFO L93 Difference]: Finished difference Result 260162 states and 1138336 transitions. [2019-12-07 17:51:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:51:33,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 17:51:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:34,208 INFO L225 Difference]: With dead ends: 260162 [2019-12-07 17:51:34,208 INFO L226 Difference]: Without dead ends: 260162 [2019-12-07 17:51:34,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:51:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260162 states. [2019-12-07 17:51:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260162 to 217926. [2019-12-07 17:51:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217926 states. [2019-12-07 17:51:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217926 states to 217926 states and 957156 transitions. [2019-12-07 17:51:43,222 INFO L78 Accepts]: Start accepts. Automaton has 217926 states and 957156 transitions. Word has length 35 [2019-12-07 17:51:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:43,222 INFO L462 AbstractCegarLoop]: Abstraction has 217926 states and 957156 transitions. [2019-12-07 17:51:43,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:51:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 217926 states and 957156 transitions. [2019-12-07 17:51:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:51:43,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:43,430 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] [2019-12-07 17:51:43,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2043615842, now seen corresponding path program 2 times [2019-12-07 17:51:43,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:43,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099468637] [2019-12-07 17:51:43,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:43,515 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:51:43,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099468637] [2019-12-07 17:51:43,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:43,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:51:43,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013724284] [2019-12-07 17:51:43,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:51:43,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:51:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:51:43,516 INFO L87 Difference]: Start difference. First operand 217926 states and 957156 transitions. Second operand 8 states. [2019-12-07 17:51:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:46,074 INFO L93 Difference]: Finished difference Result 402582 states and 1762280 transitions. [2019-12-07 17:51:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:51:46,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 17:51:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:47,652 INFO L225 Difference]: With dead ends: 402582 [2019-12-07 17:51:47,652 INFO L226 Difference]: Without dead ends: 361606 [2019-12-07 17:51:47,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:51:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361606 states. [2019-12-07 17:51:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361606 to 316686. [2019-12-07 17:51:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316686 states. [2019-12-07 17:51:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316686 states to 316686 states and 1394844 transitions. [2019-12-07 17:51:56,611 INFO L78 Accepts]: Start accepts. Automaton has 316686 states and 1394844 transitions. Word has length 35 [2019-12-07 17:51:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 316686 states and 1394844 transitions. [2019-12-07 17:51:56,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:51:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 316686 states and 1394844 transitions. [2019-12-07 17:51:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:51:57,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:57,452 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] [2019-12-07 17:51:57,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2063359088, now seen corresponding path program 1 times [2019-12-07 17:51:57,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:57,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22556776] [2019-12-07 17:51:57,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:57,489 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:51:57,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22556776] [2019-12-07 17:51:57,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:57,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:57,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525666903] [2019-12-07 17:51:57,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:57,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:57,490 INFO L87 Difference]: Start difference. First operand 316686 states and 1394844 transitions. Second operand 3 states. [2019-12-07 17:51:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:58,626 INFO L93 Difference]: Finished difference Result 242622 states and 989461 transitions. [2019-12-07 17:51:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:58,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 17:51:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:59,249 INFO L225 Difference]: With dead ends: 242622 [2019-12-07 17:51:59,250 INFO L226 Difference]: Without dead ends: 242622 [2019-12-07 17:51:59,250 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:52:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242622 states. [2019-12-07 17:52:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242622 to 242622. [2019-12-07 17:52:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242622 states. [2019-12-07 17:52:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242622 states to 242622 states and 989461 transitions. [2019-12-07 17:52:08,593 INFO L78 Accepts]: Start accepts. Automaton has 242622 states and 989461 transitions. Word has length 36 [2019-12-07 17:52:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:08,593 INFO L462 AbstractCegarLoop]: Abstraction has 242622 states and 989461 transitions. [2019-12-07 17:52:08,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:52:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 242622 states and 989461 transitions. [2019-12-07 17:52:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:52:08,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:08,854 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] [2019-12-07 17:52:08,854 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1360611929, now seen corresponding path program 1 times [2019-12-07 17:52:08,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:08,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131653201] [2019-12-07 17:52:08,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:08,884 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:52:08,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131653201] [2019-12-07 17:52:08,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:08,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:08,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801691557] [2019-12-07 17:52:08,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:08,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:08,885 INFO L87 Difference]: Start difference. First operand 242622 states and 989461 transitions. Second operand 4 states. [2019-12-07 17:52:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:09,202 INFO L93 Difference]: Finished difference Result 92647 states and 318892 transitions. [2019-12-07 17:52:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:52:09,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 17:52:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:09,363 INFO L225 Difference]: With dead ends: 92647 [2019-12-07 17:52:09,363 INFO L226 Difference]: Without dead ends: 92647 [2019-12-07 17:52:09,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92647 states. [2019-12-07 17:52:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92647 to 92647. [2019-12-07 17:52:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92647 states. [2019-12-07 17:52:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92647 states to 92647 states and 318892 transitions. [2019-12-07 17:52:11,454 INFO L78 Accepts]: Start accepts. Automaton has 92647 states and 318892 transitions. Word has length 37 [2019-12-07 17:52:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:11,454 INFO L462 AbstractCegarLoop]: Abstraction has 92647 states and 318892 transitions. [2019-12-07 17:52:11,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 92647 states and 318892 transitions. [2019-12-07 17:52:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:52:11,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:11,535 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] [2019-12-07 17:52:11,535 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1880281633, now seen corresponding path program 1 times [2019-12-07 17:52:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:11,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015005828] [2019-12-07 17:52:11,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:11,580 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:52:11,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015005828] [2019-12-07 17:52:11,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:11,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:11,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223737742] [2019-12-07 17:52:11,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:11,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:11,581 INFO L87 Difference]: Start difference. First operand 92647 states and 318892 transitions. Second operand 5 states. [2019-12-07 17:52:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:11,656 INFO L93 Difference]: Finished difference Result 14877 states and 49433 transitions. [2019-12-07 17:52:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:11,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 17:52:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:11,677 INFO L225 Difference]: With dead ends: 14877 [2019-12-07 17:52:11,677 INFO L226 Difference]: Without dead ends: 14877 [2019-12-07 17:52:11,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14877 states. [2019-12-07 17:52:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14877 to 14697. [2019-12-07 17:52:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14697 states. [2019-12-07 17:52:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14697 states to 14697 states and 48841 transitions. [2019-12-07 17:52:11,864 INFO L78 Accepts]: Start accepts. Automaton has 14697 states and 48841 transitions. Word has length 38 [2019-12-07 17:52:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:11,865 INFO L462 AbstractCegarLoop]: Abstraction has 14697 states and 48841 transitions. [2019-12-07 17:52:11,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14697 states and 48841 transitions. [2019-12-07 17:52:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:52:11,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:11,878 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] [2019-12-07 17:52:11,878 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash 351395633, now seen corresponding path program 1 times [2019-12-07 17:52:11,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:11,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156474800] [2019-12-07 17:52:11,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:11,950 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:52:11,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156474800] [2019-12-07 17:52:11,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:11,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:11,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269975371] [2019-12-07 17:52:11,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:11,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:11,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:11,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:11,951 INFO L87 Difference]: Start difference. First operand 14697 states and 48841 transitions. Second operand 4 states. [2019-12-07 17:52:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:12,027 INFO L93 Difference]: Finished difference Result 16658 states and 53971 transitions. [2019-12-07 17:52:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:12,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:52:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:12,049 INFO L225 Difference]: With dead ends: 16658 [2019-12-07 17:52:12,049 INFO L226 Difference]: Without dead ends: 16451 [2019-12-07 17:52:12,050 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:52:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2019-12-07 17:52:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 15788. [2019-12-07 17:52:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15788 states. [2019-12-07 17:52:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15788 states to 15788 states and 51393 transitions. [2019-12-07 17:52:12,261 INFO L78 Accepts]: Start accepts. Automaton has 15788 states and 51393 transitions. Word has length 49 [2019-12-07 17:52:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:12,261 INFO L462 AbstractCegarLoop]: Abstraction has 15788 states and 51393 transitions. [2019-12-07 17:52:12,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15788 states and 51393 transitions. [2019-12-07 17:52:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:52:12,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:12,276 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] [2019-12-07 17:52:12,276 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1147193727, now seen corresponding path program 2 times [2019-12-07 17:52:12,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:12,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180563776] [2019-12-07 17:52:12,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:12,549 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 17:52:12,673 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:52:12,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180563776] [2019-12-07 17:52:12,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:12,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:52:12,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638296678] [2019-12-07 17:52:12,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:52:12,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:52:12,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:52:12,674 INFO L87 Difference]: Start difference. First operand 15788 states and 51393 transitions. Second operand 10 states. [2019-12-07 17:52:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:14,418 INFO L93 Difference]: Finished difference Result 27964 states and 83955 transitions. [2019-12-07 17:52:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:52:14,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-12-07 17:52:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:14,463 INFO L225 Difference]: With dead ends: 27964 [2019-12-07 17:52:14,464 INFO L226 Difference]: Without dead ends: 25066 [2019-12-07 17:52:14,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:52:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25066 states. [2019-12-07 17:52:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25066 to 21503. [2019-12-07 17:52:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21503 states. [2019-12-07 17:52:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21503 states to 21503 states and 68519 transitions. [2019-12-07 17:52:14,773 INFO L78 Accepts]: Start accepts. Automaton has 21503 states and 68519 transitions. Word has length 49 [2019-12-07 17:52:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:14,773 INFO L462 AbstractCegarLoop]: Abstraction has 21503 states and 68519 transitions. [2019-12-07 17:52:14,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:52:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21503 states and 68519 transitions. [2019-12-07 17:52:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:52:14,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:14,793 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] [2019-12-07 17:52:14,793 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash -314694133, now seen corresponding path program 3 times [2019-12-07 17:52:14,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:14,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521838063] [2019-12-07 17:52:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:15,011 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:52:15,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521838063] [2019-12-07 17:52:15,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:15,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:52:15,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654420260] [2019-12-07 17:52:15,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:52:15,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:52:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:52:15,012 INFO L87 Difference]: Start difference. First operand 21503 states and 68519 transitions. Second operand 10 states. [2019-12-07 17:52:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:17,297 INFO L93 Difference]: Finished difference Result 44841 states and 128196 transitions. [2019-12-07 17:52:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:52:17,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-12-07 17:52:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:17,348 INFO L225 Difference]: With dead ends: 44841 [2019-12-07 17:52:17,348 INFO L226 Difference]: Without dead ends: 44006 [2019-12-07 17:52:17,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:52:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44006 states. [2019-12-07 17:52:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44006 to 29522. [2019-12-07 17:52:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29522 states. [2019-12-07 17:52:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29522 states to 29522 states and 91637 transitions. [2019-12-07 17:52:17,846 INFO L78 Accepts]: Start accepts. Automaton has 29522 states and 91637 transitions. Word has length 49 [2019-12-07 17:52:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:17,846 INFO L462 AbstractCegarLoop]: Abstraction has 29522 states and 91637 transitions. [2019-12-07 17:52:17,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:52:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29522 states and 91637 transitions. [2019-12-07 17:52:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:52:17,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:17,877 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] [2019-12-07 17:52:17,877 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1041734101, now seen corresponding path program 4 times [2019-12-07 17:52:17,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:17,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694981823] [2019-12-07 17:52:17,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:17,990 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:52:17,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694981823] [2019-12-07 17:52:17,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:17,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:52:17,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088486895] [2019-12-07 17:52:17,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:52:17,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:52:17,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:17,991 INFO L87 Difference]: Start difference. First operand 29522 states and 91637 transitions. Second operand 6 states. [2019-12-07 17:52:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:18,088 INFO L93 Difference]: Finished difference Result 26355 states and 84289 transitions. [2019-12-07 17:52:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:18,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 17:52:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:18,121 INFO L225 Difference]: With dead ends: 26355 [2019-12-07 17:52:18,122 INFO L226 Difference]: Without dead ends: 25089 [2019-12-07 17:52:18,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25089 states. [2019-12-07 17:52:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25089 to 21612. [2019-12-07 17:52:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21612 states. [2019-12-07 17:52:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21612 states to 21612 states and 69341 transitions. [2019-12-07 17:52:18,425 INFO L78 Accepts]: Start accepts. Automaton has 21612 states and 69341 transitions. Word has length 49 [2019-12-07 17:52:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:18,425 INFO L462 AbstractCegarLoop]: Abstraction has 21612 states and 69341 transitions. [2019-12-07 17:52:18,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:52:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21612 states and 69341 transitions. [2019-12-07 17:52:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:52:18,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:18,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:18,445 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:18,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1203606938, now seen corresponding path program 1 times [2019-12-07 17:52:18,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:18,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080256537] [2019-12-07 17:52:18,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:18,489 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:52:18,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080256537] [2019-12-07 17:52:18,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:18,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:52:18,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145688395] [2019-12-07 17:52:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:18,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:18,490 INFO L87 Difference]: Start difference. First operand 21612 states and 69341 transitions. Second operand 5 states. [2019-12-07 17:52:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:18,806 INFO L93 Difference]: Finished difference Result 28317 states and 90021 transitions. [2019-12-07 17:52:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:18,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 17:52:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:18,859 INFO L225 Difference]: With dead ends: 28317 [2019-12-07 17:52:18,860 INFO L226 Difference]: Without dead ends: 28013 [2019-12-07 17:52:18,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28013 states. [2019-12-07 17:52:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28013 to 22804. [2019-12-07 17:52:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22804 states. [2019-12-07 17:52:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22804 states to 22804 states and 73378 transitions. [2019-12-07 17:52:19,200 INFO L78 Accepts]: Start accepts. Automaton has 22804 states and 73378 transitions. Word has length 65 [2019-12-07 17:52:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 22804 states and 73378 transitions. [2019-12-07 17:52:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22804 states and 73378 transitions. [2019-12-07 17:52:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:52:19,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:19,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:19,221 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 329769818, now seen corresponding path program 2 times [2019-12-07 17:52:19,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:19,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557214725] [2019-12-07 17:52:19,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:19,277 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:52:19,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557214725] [2019-12-07 17:52:19,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:19,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:52:19,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407701781] [2019-12-07 17:52:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:52:19,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:52:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:19,279 INFO L87 Difference]: Start difference. First operand 22804 states and 73378 transitions. Second operand 6 states. [2019-12-07 17:52:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:19,560 INFO L93 Difference]: Finished difference Result 29840 states and 95097 transitions. [2019-12-07 17:52:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:52:19,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 17:52:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:19,600 INFO L225 Difference]: With dead ends: 29840 [2019-12-07 17:52:19,600 INFO L226 Difference]: Without dead ends: 29536 [2019-12-07 17:52:19,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:52:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29536 states. [2019-12-07 17:52:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29536 to 22808. [2019-12-07 17:52:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22808 states. [2019-12-07 17:52:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22808 states to 22808 states and 73390 transitions. [2019-12-07 17:52:19,954 INFO L78 Accepts]: Start accepts. Automaton has 22808 states and 73390 transitions. Word has length 65 [2019-12-07 17:52:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:19,954 INFO L462 AbstractCegarLoop]: Abstraction has 22808 states and 73390 transitions. [2019-12-07 17:52:19,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:52:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22808 states and 73390 transitions. [2019-12-07 17:52:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:52:19,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:19,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:19,975 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 449501000, now seen corresponding path program 3 times [2019-12-07 17:52:19,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:19,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462370162] [2019-12-07 17:52:19,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:20,015 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:52:20,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462370162] [2019-12-07 17:52:20,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:20,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:20,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294632895] [2019-12-07 17:52:20,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:20,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:20,016 INFO L87 Difference]: Start difference. First operand 22808 states and 73390 transitions. Second operand 5 states. [2019-12-07 17:52:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:20,227 INFO L93 Difference]: Finished difference Result 26346 states and 84189 transitions. [2019-12-07 17:52:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:20,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 17:52:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:20,265 INFO L225 Difference]: With dead ends: 26346 [2019-12-07 17:52:20,265 INFO L226 Difference]: Without dead ends: 26346 [2019-12-07 17:52:20,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:52:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26346 states. [2019-12-07 17:52:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26346 to 23411. [2019-12-07 17:52:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23411 states. [2019-12-07 17:52:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23411 states to 23411 states and 75436 transitions. [2019-12-07 17:52:20,617 INFO L78 Accepts]: Start accepts. Automaton has 23411 states and 75436 transitions. Word has length 65 [2019-12-07 17:52:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:20,617 INFO L462 AbstractCegarLoop]: Abstraction has 23411 states and 75436 transitions. [2019-12-07 17:52:20,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 23411 states and 75436 transitions. [2019-12-07 17:52:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:20,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:20,639 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1970151090, now seen corresponding path program 1 times [2019-12-07 17:52:20,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:20,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163482141] [2019-12-07 17:52:20,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:20,700 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:52:20,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163482141] [2019-12-07 17:52:20,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:20,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:20,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136454512] [2019-12-07 17:52:20,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:20,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:20,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:20,702 INFO L87 Difference]: Start difference. First operand 23411 states and 75436 transitions. Second operand 5 states. [2019-12-07 17:52:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:20,788 INFO L93 Difference]: Finished difference Result 24949 states and 79525 transitions. [2019-12-07 17:52:20,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:20,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:52:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:20,802 INFO L225 Difference]: With dead ends: 24949 [2019-12-07 17:52:20,802 INFO L226 Difference]: Without dead ends: 10021 [2019-12-07 17:52:20,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10021 states. [2019-12-07 17:52:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10021 to 10021. [2019-12-07 17:52:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10021 states. [2019-12-07 17:52:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 29925 transitions. [2019-12-07 17:52:20,920 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 29925 transitions. Word has length 66 [2019-12-07 17:52:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:20,920 INFO L462 AbstractCegarLoop]: Abstraction has 10021 states and 29925 transitions. [2019-12-07 17:52:20,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 29925 transitions. [2019-12-07 17:52:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:20,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:20,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:20,928 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1149192246, now seen corresponding path program 2 times [2019-12-07 17:52:20,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:20,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366977669] [2019-12-07 17:52:20,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:20,989 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:52:20,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366977669] [2019-12-07 17:52:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607726503] [2019-12-07 17:52:20,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:20,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:20,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:20,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:20,990 INFO L87 Difference]: Start difference. First operand 10021 states and 29925 transitions. Second operand 5 states. [2019-12-07 17:52:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:21,038 INFO L93 Difference]: Finished difference Result 10591 states and 31165 transitions. [2019-12-07 17:52:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:21,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:52:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:21,044 INFO L225 Difference]: With dead ends: 10591 [2019-12-07 17:52:21,044 INFO L226 Difference]: Without dead ends: 4629 [2019-12-07 17:52:21,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:52:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2019-12-07 17:52:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4629. [2019-12-07 17:52:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4629 states. [2019-12-07 17:52:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 12548 transitions. [2019-12-07 17:52:21,093 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 12548 transitions. Word has length 66 [2019-12-07 17:52:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:21,093 INFO L462 AbstractCegarLoop]: Abstraction has 4629 states and 12548 transitions. [2019-12-07 17:52:21,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 12548 transitions. [2019-12-07 17:52:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:21,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:21,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:21,096 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:21,096 INFO L82 PathProgramCache]: Analyzing trace with hash 751406376, now seen corresponding path program 3 times [2019-12-07 17:52:21,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:21,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145737419] [2019-12-07 17:52:21,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:21,149 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:52:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145737419] [2019-12-07 17:52:21,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:21,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:52:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673772705] [2019-12-07 17:52:21,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:52:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:52:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:52:21,150 INFO L87 Difference]: Start difference. First operand 4629 states and 12548 transitions. Second operand 4 states. [2019-12-07 17:52:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:21,183 INFO L93 Difference]: Finished difference Result 5170 states and 13806 transitions. [2019-12-07 17:52:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:52:21,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:52:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:21,187 INFO L225 Difference]: With dead ends: 5170 [2019-12-07 17:52:21,187 INFO L226 Difference]: Without dead ends: 4730 [2019-12-07 17:52:21,187 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:52:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2019-12-07 17:52:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4239. [2019-12-07 17:52:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-12-07 17:52:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 11495 transitions. [2019-12-07 17:52:21,232 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 11495 transitions. Word has length 66 [2019-12-07 17:52:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:21,232 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 11495 transitions. [2019-12-07 17:52:21,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:52:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 11495 transitions. [2019-12-07 17:52:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:21,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:21,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:21,235 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash 597015938, now seen corresponding path program 4 times [2019-12-07 17:52:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590257627] [2019-12-07 17:52:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:21,292 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:52:21,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590257627] [2019-12-07 17:52:21,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:21,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:52:21,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781785274] [2019-12-07 17:52:21,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:52:21,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:52:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:52:21,293 INFO L87 Difference]: Start difference. First operand 4239 states and 11495 transitions. Second operand 5 states. [2019-12-07 17:52:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:21,335 INFO L93 Difference]: Finished difference Result 4774 states and 12743 transitions. [2019-12-07 17:52:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:52:21,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:52:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:21,336 INFO L225 Difference]: With dead ends: 4774 [2019-12-07 17:52:21,336 INFO L226 Difference]: Without dead ends: 641 [2019-12-07 17:52:21,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:52:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-12-07 17:52:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-12-07 17:52:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-12-07 17:52:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1421 transitions. [2019-12-07 17:52:21,341 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1421 transitions. Word has length 66 [2019-12-07 17:52:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:21,341 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1421 transitions. [2019-12-07 17:52:21,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:52:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1421 transitions. [2019-12-07 17:52:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:21,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:21,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:21,342 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -178600644, now seen corresponding path program 5 times [2019-12-07 17:52:21,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:21,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311730649] [2019-12-07 17:52:21,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:52:21,407 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:52:21,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311730649] [2019-12-07 17:52:21,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:52:21,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:52:21,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87739588] [2019-12-07 17:52:21,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:52:21,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:52:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:52:21,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:52:21,408 INFO L87 Difference]: Start difference. First operand 641 states and 1421 transitions. Second operand 7 states. [2019-12-07 17:52:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:52:21,562 INFO L93 Difference]: Finished difference Result 1012 states and 2201 transitions. [2019-12-07 17:52:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:52:21,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 17:52:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:52:21,563 INFO L225 Difference]: With dead ends: 1012 [2019-12-07 17:52:21,563 INFO L226 Difference]: Without dead ends: 761 [2019-12-07 17:52:21,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:52:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-12-07 17:52:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 675. [2019-12-07 17:52:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-12-07 17:52:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1474 transitions. [2019-12-07 17:52:21,569 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1474 transitions. Word has length 66 [2019-12-07 17:52:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:52:21,569 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 1474 transitions. [2019-12-07 17:52:21,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:52:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1474 transitions. [2019-12-07 17:52:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:52:21,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:52:21,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:52:21,570 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:52:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:52:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1962010180, now seen corresponding path program 6 times [2019-12-07 17:52:21,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:52:21,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720349254] [2019-12-07 17:52:21,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:52:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:52:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:52:21,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:52:21,642 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:52:21,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] ULTIMATE.startENTRY-->L853: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd2~0_119 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t445~0.base_34| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t445~0.base_34|) |v_ULTIMATE.start_main_~#t445~0.offset_24| 0))) (= v_~x~0_30 0) (= v_~z$r_buff1_thd0~0_271 0) (= v_~z$r_buff0_thd1~0_119 0) (= 0 v_~z$r_buff1_thd4~0_357) (= 0 v_~__unbuffered_p3_EBX~0_62) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t445~0.offset_24|) (= 0 v_~__unbuffered_p2_EAX~0_102) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t445~0.base_34|)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t445~0.base_34| 4)) (= v_~z$w_buff1~0_242 0) (= v_~y~0_54 0) (= v_~main$tmp_guard1~0_57 0) (= 0 v_~z$flush_delayed~0_271) (= v_~main$tmp_guard0~0_23 0) (= v_~z$r_buff1_thd2~0_188 0) (= 0 v_~weak$$choice0~0_222) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff0_thd4~0_543) (= 0 v_~z$r_buff1_thd3~0_439) (= v_~weak$$choice2~0_319 0) (= v_~z$r_buff0_thd0~0_186 0) (= v_~z$w_buff0~0_347 0) (= v_~z$w_buff0_used~0_883 0) (= v_~z$read_delayed~0_7 0) (= v_~a~0_24 0) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t445~0.base_34| 1)) (= 0 v_~z$r_buff0_thd3~0_421) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t445~0.base_34|) (= 0 v_~__unbuffered_p3_EAX~0_85) (= v_~z$w_buff1_used~0_620 0) (= v_~z$r_buff1_thd1~0_188 0) (= v_~z~0_347 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~z$mem_tmp~0_234) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t448~0.offset=|v_ULTIMATE.start_main_~#t448~0.offset_16|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t445~0.offset=|v_ULTIMATE.start_main_~#t445~0.offset_24|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_543, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_85, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~z$mem_tmp~0=v_~z$mem_tmp~0_234, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ~z$flush_delayed~0=v_~z$flush_delayed~0_271, ULTIMATE.start_main_~#t447~0.offset=|v_ULTIMATE.start_main_~#t447~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_30|, ~weak$$choice0~0=v_~weak$$choice0~0_222, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_190|, ULTIMATE.start_main_~#t445~0.base=|v_ULTIMATE.start_main_~#t445~0.base_34|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_188, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_421, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ULTIMATE.start_main_~#t446~0.offset=|v_ULTIMATE.start_main_~#t446~0.offset_23|, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t446~0.base=|v_ULTIMATE.start_main_~#t446~0.base_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_357, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_22|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_57, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_271, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_883, ~z$w_buff0~0=v_~z$w_buff0~0_347, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_439, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_78|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_62, ULTIMATE.start_main_~#t448~0.base=|v_ULTIMATE.start_main_~#t448~0.base_20|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t447~0.base=|v_ULTIMATE.start_main_~#t447~0.base_25|, ~z~0=v_~z~0_347, ~weak$$choice2~0=v_~weak$$choice2~0_319, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_119} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t448~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t445~0.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t447~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t445~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t446~0.offset, ~x~0, ULTIMATE.start_main_~#t446~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t448~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t447~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:52:21,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t446~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t446~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t446~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t446~0.base_13|) |v_ULTIMATE.start_main_~#t446~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t446~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t446~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t446~0.base_13|)) (= |v_ULTIMATE.start_main_~#t446~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t446~0.base=|v_ULTIMATE.start_main_~#t446~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t446~0.offset=|v_ULTIMATE.start_main_~#t446~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t446~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t446~0.offset] because there is no mapped edge [2019-12-07 17:52:21,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L855-1-->L857: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t447~0.base_12| 4) |v_#length_23|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t447~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t447~0.base_12|) |v_ULTIMATE.start_main_~#t447~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t447~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t447~0.offset_11| 0) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t447~0.base_12| 1) |v_#valid_50|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t447~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t447~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t447~0.base=|v_ULTIMATE.start_main_~#t447~0.base_12|, #length=|v_#length_23|, ULTIMATE.start_main_~#t447~0.offset=|v_ULTIMATE.start_main_~#t447~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t447~0.base, #length, ULTIMATE.start_main_~#t447~0.offset] because there is no mapped edge [2019-12-07 17:52:21,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L857-1-->L859: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t448~0.base_10| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t448~0.offset_9| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t448~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t448~0.base_10|) |v_ULTIMATE.start_main_~#t448~0.offset_9| 3)) |v_#memory_int_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t448~0.base_10| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t448~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t448~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t448~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t448~0.offset=|v_ULTIMATE.start_main_~#t448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t448~0.base=|v_ULTIMATE.start_main_~#t448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t448~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t448~0.base] because there is no mapped edge [2019-12-07 17:52:21,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_21) (= v_P3Thread1of1ForFork2_~arg.base_6 |v_P3Thread1of1ForFork2_#in~arg.base_8|) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_54 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_94 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_94 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_8| v_P3Thread1of1ForFork2_~arg.offset_6) (= 1 v_~z$w_buff0~0_26) (= v_~z$w_buff0_used~0_95 v_~z$w_buff1_used~0_54)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_27, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_54, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, ~z$w_buff1~0=v_~z$w_buff1~0_21, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_6, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:52:21,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L815-2-->L815-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-2077024498| |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2077024498 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2077024498 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff0~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|)) (and .cse0 (= ~z$w_buff1~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1~0=~z$w_buff1~0_In-2077024498} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-2077024498|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-2077024498|, ~z$w_buff0~0=~z$w_buff0~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1~0=~z$w_buff1~0_In-2077024498} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:52:21,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (and (= v_~z$r_buff0_thd4~0_179 v_~z$r_buff0_thd4~0_180) (not (= (mod v_~weak$$choice2~0_104 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_104} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:52:21,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-957578960 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-957578960| ~z$mem_tmp~0_In-957578960) (not .cse0)) (and .cse0 (= ~z~0_In-957578960 |P3Thread1of1ForFork2_#t~ite48_Out-957578960|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-957578960, ~z$flush_delayed~0=~z$flush_delayed~0_In-957578960, ~z~0=~z~0_In-957578960} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-957578960, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-957578960|, ~z$flush_delayed~0=~z$flush_delayed~0_In-957578960, ~z~0=~z~0_In-957578960} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:52:21,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 17:52:21,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_14 1) (= (+ v_~__unbuffered_cnt~0_97 1) v_~__unbuffered_cnt~0_96) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_17)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y~0=v_~y~0_42} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_42, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:52:21,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1065028430|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1065028430 |P3Thread1of1ForFork2_#t~ite51_Out-1065028430|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1065028430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:52:21,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1401442234 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1401442234 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1401442234 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1401442234 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1401442234| ~z$w_buff1_used~0_In-1401442234) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1401442234|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401442234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401442234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401442234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401442234} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1401442234|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401442234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401442234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401442234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401442234} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L833-->L834: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-998949040 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-998949040 ~z$r_buff0_thd4~0_In-998949040)) (.cse1 (= (mod ~z$w_buff0_used~0_In-998949040 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-998949040 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-998949040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-998949040} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-998949040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-998949040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-998949040} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1885491530 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1885491530 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1885491530 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1885491530 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1885491530| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1885491530 |P3Thread1of1ForFork2_#t~ite54_Out-1885491530|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1885491530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885491530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1885491530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1885491530} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1885491530|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1885491530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885491530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1885491530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1885491530} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L834-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In641087981 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out641087981| ~z$mem_tmp~0_In641087981) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out641087981| ~z~0_In641087981)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In641087981, ~z$flush_delayed~0=~z$flush_delayed~0_In641087981, ~z~0=~z~0_In641087981} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In641087981, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out641087981|, ~z$flush_delayed~0=~z$flush_delayed~0_In641087981, ~z~0=~z~0_In641087981} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L785-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_184 |v_P2Thread1of1ForFork1_#t~ite25_48|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 v_~z$flush_delayed~0_206)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_47|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_206, ~z~0=v_~z~0_184, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:52:21,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L859-1-->L865: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:52:21,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L865-2-->L865-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2020964158 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In2020964158 256) 0))) (or (and (= ~z~0_In2020964158 |ULTIMATE.start_main_#t~ite59_Out2020964158|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In2020964158 |ULTIMATE.start_main_#t~ite59_Out2020964158|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158, ~z$w_buff1~0=~z$w_buff1~0_In2020964158, ~z~0=~z~0_In2020964158} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158, ~z$w_buff1~0=~z$w_buff1~0_In2020964158, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2020964158|, ~z~0=~z~0_In2020964158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:52:21,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L865-4-->L866: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:52:21,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-870090006 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-870090006 256)))) (or (and (= ~z$w_buff0_used~0_In-870090006 |ULTIMATE.start_main_#t~ite61_Out-870090006|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-870090006|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870090006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870090006, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-870090006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:52:21,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In958371948 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In958371948 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In958371948 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out958371948|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In958371948 |ULTIMATE.start_main_#t~ite62_Out958371948|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out958371948|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:52:21,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L868-->L868-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1998387292 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1998387292 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| ~z$r_buff0_thd0~0_In1998387292) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1998387292|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:52:21,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L869-->L869-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1986679349 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1986679349 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1986679349 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1986679349 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out1986679349| 0)) (and (= |ULTIMATE.start_main_#t~ite64_Out1986679349| ~z$r_buff1_thd0~0_In1986679349) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986679349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986679349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986679349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986679349} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986679349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986679349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986679349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986679349, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1986679349|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:52:21,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L869-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_26) (= 0 v_~__unbuffered_p1_EAX~0_23) (= 0 v_~__unbuffered_p2_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_222 |v_ULTIMATE.start_main_#t~ite64_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_42|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:52:21,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:52:21 BasicIcfg [2019-12-07 17:52:21,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:52:21,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:52:21,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:52:21,731 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:52:21,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:50:10" (3/4) ... [2019-12-07 17:52:21,733 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:52:21,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] ULTIMATE.startENTRY-->L853: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd2~0_119 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t445~0.base_34| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t445~0.base_34|) |v_ULTIMATE.start_main_~#t445~0.offset_24| 0))) (= v_~x~0_30 0) (= v_~z$r_buff1_thd0~0_271 0) (= v_~z$r_buff0_thd1~0_119 0) (= 0 v_~z$r_buff1_thd4~0_357) (= 0 v_~__unbuffered_p3_EBX~0_62) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t445~0.offset_24|) (= 0 v_~__unbuffered_p2_EAX~0_102) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t445~0.base_34|)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t445~0.base_34| 4)) (= v_~z$w_buff1~0_242 0) (= v_~y~0_54 0) (= v_~main$tmp_guard1~0_57 0) (= 0 v_~z$flush_delayed~0_271) (= v_~main$tmp_guard0~0_23 0) (= v_~z$r_buff1_thd2~0_188 0) (= 0 v_~weak$$choice0~0_222) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff0_thd4~0_543) (= 0 v_~z$r_buff1_thd3~0_439) (= v_~weak$$choice2~0_319 0) (= v_~z$r_buff0_thd0~0_186 0) (= v_~z$w_buff0~0_347 0) (= v_~z$w_buff0_used~0_883 0) (= v_~z$read_delayed~0_7 0) (= v_~a~0_24 0) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t445~0.base_34| 1)) (= 0 v_~z$r_buff0_thd3~0_421) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t445~0.base_34|) (= 0 v_~__unbuffered_p3_EAX~0_85) (= v_~z$w_buff1_used~0_620 0) (= v_~z$r_buff1_thd1~0_188 0) (= v_~z~0_347 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~z$mem_tmp~0_234) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t448~0.offset=|v_ULTIMATE.start_main_~#t448~0.offset_16|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t445~0.offset=|v_ULTIMATE.start_main_~#t445~0.offset_24|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_543, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_85, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~z$mem_tmp~0=v_~z$mem_tmp~0_234, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ~z$flush_delayed~0=v_~z$flush_delayed~0_271, ULTIMATE.start_main_~#t447~0.offset=|v_ULTIMATE.start_main_~#t447~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_30|, ~weak$$choice0~0=v_~weak$$choice0~0_222, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_190|, ULTIMATE.start_main_~#t445~0.base=|v_ULTIMATE.start_main_~#t445~0.base_34|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_188, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_421, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ULTIMATE.start_main_~#t446~0.offset=|v_ULTIMATE.start_main_~#t446~0.offset_23|, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t446~0.base=|v_ULTIMATE.start_main_~#t446~0.base_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_357, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_22|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_57, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_271, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_883, ~z$w_buff0~0=v_~z$w_buff0~0_347, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_439, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_78|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_62, ULTIMATE.start_main_~#t448~0.base=|v_ULTIMATE.start_main_~#t448~0.base_20|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t447~0.base=|v_ULTIMATE.start_main_~#t447~0.base_25|, ~z~0=v_~z~0_347, ~weak$$choice2~0=v_~weak$$choice2~0_319, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_119} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t448~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t445~0.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t447~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t445~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t446~0.offset, ~x~0, ULTIMATE.start_main_~#t446~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t448~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t447~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:52:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t446~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t446~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t446~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t446~0.base_13|) |v_ULTIMATE.start_main_~#t446~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t446~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t446~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t446~0.base_13|)) (= |v_ULTIMATE.start_main_~#t446~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t446~0.base=|v_ULTIMATE.start_main_~#t446~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t446~0.offset=|v_ULTIMATE.start_main_~#t446~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t446~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t446~0.offset] because there is no mapped edge [2019-12-07 17:52:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L855-1-->L857: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t447~0.base_12| 4) |v_#length_23|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t447~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t447~0.base_12|) |v_ULTIMATE.start_main_~#t447~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t447~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t447~0.offset_11| 0) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t447~0.base_12| 1) |v_#valid_50|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t447~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t447~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t447~0.base=|v_ULTIMATE.start_main_~#t447~0.base_12|, #length=|v_#length_23|, ULTIMATE.start_main_~#t447~0.offset=|v_ULTIMATE.start_main_~#t447~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t447~0.base, #length, ULTIMATE.start_main_~#t447~0.offset] because there is no mapped edge [2019-12-07 17:52:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L857-1-->L859: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t448~0.base_10| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t448~0.offset_9| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t448~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t448~0.base_10|) |v_ULTIMATE.start_main_~#t448~0.offset_9| 3)) |v_#memory_int_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t448~0.base_10| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t448~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t448~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t448~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t448~0.offset=|v_ULTIMATE.start_main_~#t448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t448~0.base=|v_ULTIMATE.start_main_~#t448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t448~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t448~0.base] because there is no mapped edge [2019-12-07 17:52:21,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_21) (= v_P3Thread1of1ForFork2_~arg.base_6 |v_P3Thread1of1ForFork2_#in~arg.base_8|) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_54 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_94 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|) (= v_~z$w_buff0_used~0_94 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_8| v_P3Thread1of1ForFork2_~arg.offset_6) (= 1 v_~z$w_buff0~0_26) (= v_~z$w_buff0_used~0_95 v_~z$w_buff1_used~0_54)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_27, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_8, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_54, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_8|, ~z$w_buff1~0=v_~z$w_buff1~0_21, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_6, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_8|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:52:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L815-2-->L815-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-2077024498| |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2077024498 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2077024498 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff0~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|)) (and .cse0 (= ~z$w_buff1~0_In-2077024498 |P3Thread1of1ForFork2_#t~ite28_Out-2077024498|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1~0=~z$w_buff1~0_In-2077024498} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-2077024498|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-2077024498|, ~z$w_buff0~0=~z$w_buff0~0_In-2077024498, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2077024498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2077024498, ~z$w_buff1~0=~z$w_buff1~0_In-2077024498} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:52:21,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (and (= v_~z$r_buff0_thd4~0_179 v_~z$r_buff0_thd4~0_180) (not (= (mod v_~weak$$choice2~0_104 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_104} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:52:21,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-957578960 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-957578960| ~z$mem_tmp~0_In-957578960) (not .cse0)) (and .cse0 (= ~z~0_In-957578960 |P3Thread1of1ForFork2_#t~ite48_Out-957578960|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-957578960, ~z$flush_delayed~0=~z$flush_delayed~0_In-957578960, ~z~0=~z~0_In-957578960} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-957578960, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-957578960|, ~z$flush_delayed~0=~z$flush_delayed~0_In-957578960, ~z~0=~z~0_In-957578960} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:52:21,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 17:52:21,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_14 1) (= (+ v_~__unbuffered_cnt~0_97 1) v_~__unbuffered_cnt~0_96) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_17)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y~0=v_~y~0_42} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_42, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:52:21,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1065028430|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1065028430 |P3Thread1of1ForFork2_#t~ite51_Out-1065028430|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1065028430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:52:21,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1401442234 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1401442234 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1401442234 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1401442234 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1401442234| ~z$w_buff1_used~0_In-1401442234) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1401442234|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401442234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401442234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401442234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401442234} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1401442234|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401442234, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401442234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401442234, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401442234} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:52:21,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L833-->L834: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-998949040 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-998949040 ~z$r_buff0_thd4~0_In-998949040)) (.cse1 (= (mod ~z$w_buff0_used~0_In-998949040 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-998949040 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-998949040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-998949040} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-998949040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-998949040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-998949040} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:52:21,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1885491530 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1885491530 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1885491530 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1885491530 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1885491530| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1885491530 |P3Thread1of1ForFork2_#t~ite54_Out-1885491530|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1885491530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885491530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1885491530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1885491530} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1885491530|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1885491530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885491530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1885491530, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1885491530} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:52:21,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L834-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:52:21,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In641087981 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out641087981| ~z$mem_tmp~0_In641087981) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out641087981| ~z~0_In641087981)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In641087981, ~z$flush_delayed~0=~z$flush_delayed~0_In641087981, ~z~0=~z~0_In641087981} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In641087981, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out641087981|, ~z$flush_delayed~0=~z$flush_delayed~0_In641087981, ~z~0=~z~0_In641087981} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:52:21,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L785-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_184 |v_P2Thread1of1ForFork1_#t~ite25_48|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 v_~z$flush_delayed~0_206)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_47|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_206, ~z~0=v_~z~0_184, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:52:21,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L859-1-->L865: Formula: (and (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_38) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:52:21,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L865-2-->L865-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2020964158 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In2020964158 256) 0))) (or (and (= ~z~0_In2020964158 |ULTIMATE.start_main_#t~ite59_Out2020964158|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In2020964158 |ULTIMATE.start_main_#t~ite59_Out2020964158|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158, ~z$w_buff1~0=~z$w_buff1~0_In2020964158, ~z~0=~z~0_In2020964158} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2020964158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2020964158, ~z$w_buff1~0=~z$w_buff1~0_In2020964158, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2020964158|, ~z~0=~z~0_In2020964158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:52:21,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L865-4-->L866: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:52:21,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-870090006 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-870090006 256)))) (or (and (= ~z$w_buff0_used~0_In-870090006 |ULTIMATE.start_main_#t~ite61_Out-870090006|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-870090006|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870090006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-870090006, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-870090006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:52:21,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In958371948 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In958371948 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In958371948 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out958371948|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In958371948 |ULTIMATE.start_main_#t~ite62_Out958371948|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out958371948|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:52:21,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L868-->L868-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1998387292 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1998387292 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| ~z$r_buff0_thd0~0_In1998387292) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1998387292|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:52:21,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L869-->L869-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1986679349 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1986679349 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1986679349 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1986679349 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out1986679349| 0)) (and (= |ULTIMATE.start_main_#t~ite64_Out1986679349| ~z$r_buff1_thd0~0_In1986679349) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986679349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986679349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986679349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986679349} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986679349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986679349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986679349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986679349, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1986679349|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:52:21,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L869-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_26) (= 0 v_~__unbuffered_p1_EAX~0_23) (= 0 v_~__unbuffered_p2_EAX~0_42) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1)) (= v_~z$r_buff1_thd0~0_222 |v_ULTIMATE.start_main_#t~ite64_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_222, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_42|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:52:21,814 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0fcdfbec-83f0-4c11-b2f0-19ca056d25d3/bin/uautomizer/witness.graphml [2019-12-07 17:52:21,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:52:21,815 INFO L168 Benchmark]: Toolchain (without parser) took 132403.78 ms. Allocated memory was 1.0 GB in the beginning and 9.2 GB in the end (delta: 8.1 GB). Free memory was 938.2 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,816 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:52:21,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.78 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:52:21,816 INFO L168 Benchmark]: Boogie Preprocessor took 28.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,816 INFO L168 Benchmark]: RCFGBuilder took 459.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,817 INFO L168 Benchmark]: TraceAbstraction took 131388.40 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.0 GB). Free memory was 988.6 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,817 INFO L168 Benchmark]: Witness Printer took 83.29 ms. Allocated memory is still 9.2 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 71.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:52:21,818 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.78 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. * Boogie Preprocessor took 28.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 459.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 131388.40 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.0 GB). Free memory was 988.6 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 83.29 ms. Allocated memory is still 9.2 GB. Free memory was 4.8 GB in the beginning and 4.8 GB in the end (delta: 71.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 212 ProgramPointsBefore, 113 ProgramPointsAfterwards, 255 TransitionsBefore, 133 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 11467 VarBasedMoverChecksPositive, 326 VarBasedMoverChecksNegative, 90 SemBasedMoverChecksPositive, 332 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128453 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L853] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 131.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6072 SDtfs, 7393 SDslu, 11668 SDs, 0 SdLazy, 5241 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316686occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 255440 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 329011 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...