./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/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 8539432b00a53eb8fc656714afc6a411e43b0815 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:26:26,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:26:26,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:26:26,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:26:26,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:26:26,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:26:26,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:26:26,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:26:26,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:26:26,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:26:26,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:26:26,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:26:26,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:26:26,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:26:26,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:26:26,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:26:26,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:26:26,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:26:26,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:26:26,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:26:26,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:26:26,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:26:26,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:26:26,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:26:26,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:26:26,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:26:26,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:26:26,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:26:26,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:26:26,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:26:26,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:26:26,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:26:26,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:26:26,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:26:26,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:26:26,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:26:26,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:26:26,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:26:26,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:26:26,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:26:26,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:26:26,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:26:26,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:26:26,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:26:26,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:26:26,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:26:26,739 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:26:26,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:26:26,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:26:26,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:26:26,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:26:26,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:26:26,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:26:26,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:26:26,742 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:26:26,742 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_cd921949-2c36-46ca-b100-810f13f0de42/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 -> 8539432b00a53eb8fc656714afc6a411e43b0815 [2019-12-07 10:26:26,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:26:26,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:26:26,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:26:26,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:26:26,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:26:26,860 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i [2019-12-07 10:26:26,900 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/data/d1e88d35d/99a9896b5f2c431fa1584eeed2fed5f7/FLAGaf82517e0 [2019-12-07 10:26:27,368 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:26:27,368 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/sv-benchmarks/c/pthread-wmm/mix052_rmo.oepc.i [2019-12-07 10:26:27,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/data/d1e88d35d/99a9896b5f2c431fa1584eeed2fed5f7/FLAGaf82517e0 [2019-12-07 10:26:27,694 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/data/d1e88d35d/99a9896b5f2c431fa1584eeed2fed5f7 [2019-12-07 10:26:27,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:26:27,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:26:27,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:26:27,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:26:27,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:26:27,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:26:27" (1/1) ... [2019-12-07 10:26:27,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a24d28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:27, skipping insertion in model container [2019-12-07 10:26:27,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:26:27" (1/1) ... [2019-12-07 10:26:27,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:26:27,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:26:27,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:26:28,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:26:28,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:26:28,091 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:26:28,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28 WrapperNode [2019-12-07 10:26:28,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:26:28,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:26:28,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:26:28,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:26:28,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:26:28,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:26:28,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:26:28,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:26:28,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... [2019-12-07 10:26:28,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:26:28,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:26:28,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:26:28,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:26:28,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/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 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:26:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:26:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:26:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:26:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:26:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:26:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:26:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:26:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:26:28,195 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 10:26:28,574 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:26:28,574 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:26:28,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:28 BoogieIcfgContainer [2019-12-07 10:26:28,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:26:28,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:26:28,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:26:28,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:26:28,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:26:27" (1/3) ... [2019-12-07 10:26:28,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1936975f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:26:28, skipping insertion in model container [2019-12-07 10:26:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:26:28" (2/3) ... [2019-12-07 10:26:28,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1936975f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:26:28, skipping insertion in model container [2019-12-07 10:26:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:28" (3/3) ... [2019-12-07 10:26:28,581 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2019-12-07 10:26:28,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:26:28,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:26:28,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:26:28,597 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:26:28,655 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:26:28,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:26:28,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:26:28,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:26:28,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:26:28,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:26:28,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:26:28,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:26:28,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:26:28,678 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 10:26:28,679 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 10:26:28,735 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 10:26:28,735 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:26:28,744 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:26:28,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 10:26:28,792 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 10:26:28,793 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:26:28,798 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:26:28,813 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 10:26:28,814 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:26:31,972 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 10:26:32,245 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-07 10:26:32,246 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 10:26:32,249 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-07 10:26:46,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-07 10:26:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-07 10:26:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:26:46,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:46,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:26:46,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:26:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-07 10:26:46,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:46,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147579304] [2019-12-07 10:26:46,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:46,434 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 10:26:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147579304] [2019-12-07 10:26:46,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:46,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:26:46,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809400564] [2019-12-07 10:26:46,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:26:46,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:26:46,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:26:46,449 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-07 10:26:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:47,293 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-07 10:26:47,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:26:47,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:26:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:47,706 INFO L225 Difference]: With dead ends: 110910 [2019-12-07 10:26:47,706 INFO L226 Difference]: Without dead ends: 98066 [2019-12-07 10:26:47,707 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 10:26:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-07 10:26:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-07 10:26:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-07 10:26:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-07 10:26:54,142 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-07 10:26:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:26:54,143 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-07 10:26:54,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:26:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-07 10:26:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:26:54,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:26:54,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:26:54,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:26:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:26:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-07 10:26:54,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:26:54,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672451834] [2019-12-07 10:26:54,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:26:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:26:54,204 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 10:26:54,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672451834] [2019-12-07 10:26:54,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:26:54,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:26:54,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206753581] [2019-12-07 10:26:54,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:26:54,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:26:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:26:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:26:54,206 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-07 10:26:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:26:55,052 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-07 10:26:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:26:55,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:26:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:26:55,776 INFO L225 Difference]: With dead ends: 156656 [2019-12-07 10:26:55,777 INFO L226 Difference]: Without dead ends: 156558 [2019-12-07 10:26:55,777 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 10:27:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-07 10:27:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-07 10:27:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-07 10:27:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-07 10:27:02,793 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-07 10:27:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:02,793 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-07 10:27:02,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-07 10:27:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:27:02,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:02,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:02,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-07 10:27:02,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:02,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547679554] [2019-12-07 10:27:02,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:02,852 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 10:27:02,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547679554] [2019-12-07 10:27:02,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:02,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:27:02,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701279265] [2019-12-07 10:27:02,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:27:02,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:27:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:27:02,853 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 4 states. [2019-12-07 10:27:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:03,844 INFO L93 Difference]: Finished difference Result 205190 states and 828176 transitions. [2019-12-07 10:27:03,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:03,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:27:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:04,361 INFO L225 Difference]: With dead ends: 205190 [2019-12-07 10:27:04,362 INFO L226 Difference]: Without dead ends: 205078 [2019-12-07 10:27:04,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 10:27:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205078 states. [2019-12-07 10:27:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205078 to 171310. [2019-12-07 10:27:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171310 states. [2019-12-07 10:27:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171310 states to 171310 states and 704416 transitions. [2019-12-07 10:27:14,147 INFO L78 Accepts]: Start accepts. Automaton has 171310 states and 704416 transitions. Word has length 13 [2019-12-07 10:27:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:14,147 INFO L462 AbstractCegarLoop]: Abstraction has 171310 states and 704416 transitions. [2019-12-07 10:27:14,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:27:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 171310 states and 704416 transitions. [2019-12-07 10:27:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:27:14,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:14,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:14,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-07 10:27:14,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:14,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474662892] [2019-12-07 10:27:14,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:14,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 10:27:14,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474662892] [2019-12-07 10:27:14,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:14,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:14,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985724499] [2019-12-07 10:27:14,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:14,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:14,202 INFO L87 Difference]: Start difference. First operand 171310 states and 704416 transitions. Second operand 5 states. [2019-12-07 10:27:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:15,410 INFO L93 Difference]: Finished difference Result 231848 states and 943034 transitions. [2019-12-07 10:27:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:27:15,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 10:27:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:16,462 INFO L225 Difference]: With dead ends: 231848 [2019-12-07 10:27:16,462 INFO L226 Difference]: Without dead ends: 231848 [2019-12-07 10:27:16,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231848 states. [2019-12-07 10:27:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231848 to 191437. [2019-12-07 10:27:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191437 states. [2019-12-07 10:27:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191437 states to 191437 states and 785356 transitions. [2019-12-07 10:27:27,610 INFO L78 Accepts]: Start accepts. Automaton has 191437 states and 785356 transitions. Word has length 16 [2019-12-07 10:27:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:27,610 INFO L462 AbstractCegarLoop]: Abstraction has 191437 states and 785356 transitions. [2019-12-07 10:27:27,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 191437 states and 785356 transitions. [2019-12-07 10:27:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:27:27,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:27,629 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 10:27:27,629 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1118041263, now seen corresponding path program 1 times [2019-12-07 10:27:27,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:27,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416826591] [2019-12-07 10:27:27,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:27,679 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 10:27:27,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416826591] [2019-12-07 10:27:27,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:27,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:27:27,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672779474] [2019-12-07 10:27:27,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:27,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:27,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:27,680 INFO L87 Difference]: Start difference. First operand 191437 states and 785356 transitions. Second operand 3 states. [2019-12-07 10:27:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:28,963 INFO L93 Difference]: Finished difference Result 320205 states and 1305877 transitions. [2019-12-07 10:27:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:28,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:27:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:29,673 INFO L225 Difference]: With dead ends: 320205 [2019-12-07 10:27:29,673 INFO L226 Difference]: Without dead ends: 285016 [2019-12-07 10:27:29,674 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 10:27:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285016 states. [2019-12-07 10:27:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285016 to 272392. [2019-12-07 10:27:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272392 states. [2019-12-07 10:27:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272392 states to 272392 states and 1119276 transitions. [2019-12-07 10:27:43,261 INFO L78 Accepts]: Start accepts. Automaton has 272392 states and 1119276 transitions. Word has length 18 [2019-12-07 10:27:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:43,262 INFO L462 AbstractCegarLoop]: Abstraction has 272392 states and 1119276 transitions. [2019-12-07 10:27:43,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 272392 states and 1119276 transitions. [2019-12-07 10:27:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:27:43,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:43,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:43,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash -465864047, now seen corresponding path program 1 times [2019-12-07 10:27:43,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:43,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624602795] [2019-12-07 10:27:43,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:43,330 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 10:27:43,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624602795] [2019-12-07 10:27:43,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:43,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:27:43,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293665814] [2019-12-07 10:27:43,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:43,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:43,332 INFO L87 Difference]: Start difference. First operand 272392 states and 1119276 transitions. Second operand 3 states. [2019-12-07 10:27:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:44,856 INFO L93 Difference]: Finished difference Result 272392 states and 1107976 transitions. [2019-12-07 10:27:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:44,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:27:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:45,541 INFO L225 Difference]: With dead ends: 272392 [2019-12-07 10:27:45,541 INFO L226 Difference]: Without dead ends: 272392 [2019-12-07 10:27:45,541 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 10:27:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272392 states. [2019-12-07 10:27:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272392 to 269248. [2019-12-07 10:27:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269248 states. [2019-12-07 10:27:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269248 states to 269248 states and 1096514 transitions. [2019-12-07 10:27:58,648 INFO L78 Accepts]: Start accepts. Automaton has 269248 states and 1096514 transitions. Word has length 19 [2019-12-07 10:27:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:58,648 INFO L462 AbstractCegarLoop]: Abstraction has 269248 states and 1096514 transitions. [2019-12-07 10:27:58,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 269248 states and 1096514 transitions. [2019-12-07 10:27:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:27:58,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:58,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:58,665 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1757364841, now seen corresponding path program 1 times [2019-12-07 10:27:58,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:27:58,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182107671] [2019-12-07 10:27:58,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:58,695 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 10:27:58,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182107671] [2019-12-07 10:27:58,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:58,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:27:58,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918404042] [2019-12-07 10:27:58,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:58,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:27:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:58,697 INFO L87 Difference]: Start difference. First operand 269248 states and 1096514 transitions. Second operand 3 states. [2019-12-07 10:27:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:58,856 INFO L93 Difference]: Finished difference Result 48228 states and 156282 transitions. [2019-12-07 10:27:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:27:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:58,921 INFO L225 Difference]: With dead ends: 48228 [2019-12-07 10:27:58,921 INFO L226 Difference]: Without dead ends: 48228 [2019-12-07 10:27:58,921 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 10:27:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2019-12-07 10:27:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 48228. [2019-12-07 10:27:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48228 states. [2019-12-07 10:28:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48228 states to 48228 states and 156282 transitions. [2019-12-07 10:28:00,000 INFO L78 Accepts]: Start accepts. Automaton has 48228 states and 156282 transitions. Word has length 19 [2019-12-07 10:28:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:00,000 INFO L462 AbstractCegarLoop]: Abstraction has 48228 states and 156282 transitions. [2019-12-07 10:28:00,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 48228 states and 156282 transitions. [2019-12-07 10:28:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:28:00,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:00,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:00,007 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-07 10:28:00,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:00,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668379697] [2019-12-07 10:28:00,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:00,048 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 10:28:00,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668379697] [2019-12-07 10:28:00,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:00,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:28:00,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318002400] [2019-12-07 10:28:00,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:00,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:00,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:00,049 INFO L87 Difference]: Start difference. First operand 48228 states and 156282 transitions. Second operand 6 states. [2019-12-07 10:28:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:00,630 INFO L93 Difference]: Finished difference Result 70457 states and 222266 transitions. [2019-12-07 10:28:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:28:00,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:28:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:00,732 INFO L225 Difference]: With dead ends: 70457 [2019-12-07 10:28:00,733 INFO L226 Difference]: Without dead ends: 70443 [2019-12-07 10:28:00,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:28:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70443 states. [2019-12-07 10:28:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70443 to 50158. [2019-12-07 10:28:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50158 states. [2019-12-07 10:28:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50158 states to 50158 states and 161575 transitions. [2019-12-07 10:28:01,677 INFO L78 Accepts]: Start accepts. Automaton has 50158 states and 161575 transitions. Word has length 22 [2019-12-07 10:28:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:01,677 INFO L462 AbstractCegarLoop]: Abstraction has 50158 states and 161575 transitions. [2019-12-07 10:28:01,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 50158 states and 161575 transitions. [2019-12-07 10:28:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:28:01,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:01,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:01,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:01,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-07 10:28:01,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:01,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033530182] [2019-12-07 10:28:01,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:01,737 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 10:28:01,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033530182] [2019-12-07 10:28:01,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:01,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:01,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976211351] [2019-12-07 10:28:01,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:28:01,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:28:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:28:01,738 INFO L87 Difference]: Start difference. First operand 50158 states and 161575 transitions. Second operand 5 states. [2019-12-07 10:28:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:02,154 INFO L93 Difference]: Finished difference Result 64850 states and 204706 transitions. [2019-12-07 10:28:02,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:28:02,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:28:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:02,246 INFO L225 Difference]: With dead ends: 64850 [2019-12-07 10:28:02,246 INFO L226 Difference]: Without dead ends: 64824 [2019-12-07 10:28:02,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:28:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64824 states. [2019-12-07 10:28:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64824 to 57106. [2019-12-07 10:28:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57106 states. [2019-12-07 10:28:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57106 states to 57106 states and 182757 transitions. [2019-12-07 10:28:03,597 INFO L78 Accepts]: Start accepts. Automaton has 57106 states and 182757 transitions. Word has length 25 [2019-12-07 10:28:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:03,597 INFO L462 AbstractCegarLoop]: Abstraction has 57106 states and 182757 transitions. [2019-12-07 10:28:03,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:28:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57106 states and 182757 transitions. [2019-12-07 10:28:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:28:03,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:03,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:03,615 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-07 10:28:03,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:03,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971075775] [2019-12-07 10:28:03,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:28:03,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971075775] [2019-12-07 10:28:03,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:03,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:28:03,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708710550] [2019-12-07 10:28:03,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:03,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:03,659 INFO L87 Difference]: Start difference. First operand 57106 states and 182757 transitions. Second operand 6 states. [2019-12-07 10:28:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:04,199 INFO L93 Difference]: Finished difference Result 78306 states and 244062 transitions. [2019-12-07 10:28:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:28:04,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 10:28:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:04,312 INFO L225 Difference]: With dead ends: 78306 [2019-12-07 10:28:04,312 INFO L226 Difference]: Without dead ends: 78230 [2019-12-07 10:28:04,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:28:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78230 states. [2019-12-07 10:28:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78230 to 61534. [2019-12-07 10:28:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61534 states. [2019-12-07 10:28:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61534 states to 61534 states and 195704 transitions. [2019-12-07 10:28:05,495 INFO L78 Accepts]: Start accepts. Automaton has 61534 states and 195704 transitions. Word has length 27 [2019-12-07 10:28:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:05,496 INFO L462 AbstractCegarLoop]: Abstraction has 61534 states and 195704 transitions. [2019-12-07 10:28:05,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 61534 states and 195704 transitions. [2019-12-07 10:28:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:28:05,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:05,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:05,516 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 874122726, now seen corresponding path program 1 times [2019-12-07 10:28:05,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:05,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138085087] [2019-12-07 10:28:05,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:05,548 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 10:28:05,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138085087] [2019-12-07 10:28:05,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:05,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:05,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933879948] [2019-12-07 10:28:05,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:28:05,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:28:05,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:28:05,549 INFO L87 Difference]: Start difference. First operand 61534 states and 195704 transitions. Second operand 4 states. [2019-12-07 10:28:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:05,612 INFO L93 Difference]: Finished difference Result 23873 states and 72799 transitions. [2019-12-07 10:28:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:28:05,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 10:28:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:05,637 INFO L225 Difference]: With dead ends: 23873 [2019-12-07 10:28:05,638 INFO L226 Difference]: Without dead ends: 23873 [2019-12-07 10:28:05,638 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 10:28:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23873 states. [2019-12-07 10:28:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23873 to 22743. [2019-12-07 10:28:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22743 states. [2019-12-07 10:28:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22743 states to 22743 states and 69534 transitions. [2019-12-07 10:28:05,948 INFO L78 Accepts]: Start accepts. Automaton has 22743 states and 69534 transitions. Word has length 30 [2019-12-07 10:28:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:05,948 INFO L462 AbstractCegarLoop]: Abstraction has 22743 states and 69534 transitions. [2019-12-07 10:28:05,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:28:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22743 states and 69534 transitions. [2019-12-07 10:28:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:28:05,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:05,964 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] [2019-12-07 10:28:05,964 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-07 10:28:05,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:05,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014366840] [2019-12-07 10:28:05,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:06,024 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 10:28:06,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014366840] [2019-12-07 10:28:06,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:06,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:28:06,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743924435] [2019-12-07 10:28:06,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:28:06,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:28:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:28:06,025 INFO L87 Difference]: Start difference. First operand 22743 states and 69534 transitions. Second operand 7 states. [2019-12-07 10:28:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:06,723 INFO L93 Difference]: Finished difference Result 30013 states and 88944 transitions. [2019-12-07 10:28:06,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:28:06,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 10:28:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:06,756 INFO L225 Difference]: With dead ends: 30013 [2019-12-07 10:28:06,756 INFO L226 Difference]: Without dead ends: 30013 [2019-12-07 10:28:06,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:28:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-07 10:28:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 22398. [2019-12-07 10:28:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22398 states. [2019-12-07 10:28:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22398 states to 22398 states and 68308 transitions. [2019-12-07 10:28:07,119 INFO L78 Accepts]: Start accepts. Automaton has 22398 states and 68308 transitions. Word has length 33 [2019-12-07 10:28:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:07,119 INFO L462 AbstractCegarLoop]: Abstraction has 22398 states and 68308 transitions. [2019-12-07 10:28:07,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:28:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22398 states and 68308 transitions. [2019-12-07 10:28:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:28:07,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:07,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:07,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash 604372690, now seen corresponding path program 1 times [2019-12-07 10:28:07,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:07,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266530527] [2019-12-07 10:28:07,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:07,178 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 10:28:07,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266530527] [2019-12-07 10:28:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:07,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:28:07,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050905620] [2019-12-07 10:28:07,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:07,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:07,180 INFO L87 Difference]: Start difference. First operand 22398 states and 68308 transitions. Second operand 3 states. [2019-12-07 10:28:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:07,251 INFO L93 Difference]: Finished difference Result 22398 states and 67426 transitions. [2019-12-07 10:28:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:07,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 10:28:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:07,277 INFO L225 Difference]: With dead ends: 22398 [2019-12-07 10:28:07,277 INFO L226 Difference]: Without dead ends: 22398 [2019-12-07 10:28:07,277 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 10:28:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2019-12-07 10:28:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 22008. [2019-12-07 10:28:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22008 states. [2019-12-07 10:28:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22008 states to 22008 states and 66346 transitions. [2019-12-07 10:28:07,578 INFO L78 Accepts]: Start accepts. Automaton has 22008 states and 66346 transitions. Word has length 40 [2019-12-07 10:28:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:07,578 INFO L462 AbstractCegarLoop]: Abstraction has 22008 states and 66346 transitions. [2019-12-07 10:28:07,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22008 states and 66346 transitions. [2019-12-07 10:28:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:28:07,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:07,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:07,597 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1437156552, now seen corresponding path program 1 times [2019-12-07 10:28:07,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468237029] [2019-12-07 10:28:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:07,635 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 10:28:07,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468237029] [2019-12-07 10:28:07,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:07,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:28:07,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323363263] [2019-12-07 10:28:07,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:28:07,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:28:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:28:07,637 INFO L87 Difference]: Start difference. First operand 22008 states and 66346 transitions. Second operand 5 states. [2019-12-07 10:28:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:07,703 INFO L93 Difference]: Finished difference Result 20270 states and 62501 transitions. [2019-12-07 10:28:07,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:28:07,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 10:28:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:07,725 INFO L225 Difference]: With dead ends: 20270 [2019-12-07 10:28:07,725 INFO L226 Difference]: Without dead ends: 19763 [2019-12-07 10:28:07,725 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 10:28:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-12-07 10:28:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 13019. [2019-12-07 10:28:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13019 states. [2019-12-07 10:28:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13019 states to 13019 states and 39840 transitions. [2019-12-07 10:28:07,975 INFO L78 Accepts]: Start accepts. Automaton has 13019 states and 39840 transitions. Word has length 41 [2019-12-07 10:28:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:07,975 INFO L462 AbstractCegarLoop]: Abstraction has 13019 states and 39840 transitions. [2019-12-07 10:28:07,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:28:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13019 states and 39840 transitions. [2019-12-07 10:28:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:28:07,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:07,986 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 10:28:07,986 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1448287585, now seen corresponding path program 1 times [2019-12-07 10:28:07,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:07,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446530542] [2019-12-07 10:28:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:08,016 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 10:28:08,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446530542] [2019-12-07 10:28:08,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:08,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:08,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745105901] [2019-12-07 10:28:08,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:08,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:08,017 INFO L87 Difference]: Start difference. First operand 13019 states and 39840 transitions. Second operand 3 states. [2019-12-07 10:28:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:08,080 INFO L93 Difference]: Finished difference Result 18559 states and 57120 transitions. [2019-12-07 10:28:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:08,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:28:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:08,099 INFO L225 Difference]: With dead ends: 18559 [2019-12-07 10:28:08,099 INFO L226 Difference]: Without dead ends: 18559 [2019-12-07 10:28:08,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18559 states. [2019-12-07 10:28:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18559 to 14685. [2019-12-07 10:28:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14685 states. [2019-12-07 10:28:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 45666 transitions. [2019-12-07 10:28:08,331 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 45666 transitions. Word has length 66 [2019-12-07 10:28:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:08,331 INFO L462 AbstractCegarLoop]: Abstraction has 14685 states and 45666 transitions. [2019-12-07 10:28:08,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 45666 transitions. [2019-12-07 10:28:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:28:08,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:08,344 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 10:28:08,344 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 464347479, now seen corresponding path program 1 times [2019-12-07 10:28:08,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:08,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323180384] [2019-12-07 10:28:08,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:08,385 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 10:28:08,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323180384] [2019-12-07 10:28:08,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:08,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:28:08,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6453373] [2019-12-07 10:28:08,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:08,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:08,386 INFO L87 Difference]: Start difference. First operand 14685 states and 45666 transitions. Second operand 3 states. [2019-12-07 10:28:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:08,453 INFO L93 Difference]: Finished difference Result 17661 states and 54594 transitions. [2019-12-07 10:28:08,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:08,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:28:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:08,471 INFO L225 Difference]: With dead ends: 17661 [2019-12-07 10:28:08,471 INFO L226 Difference]: Without dead ends: 17661 [2019-12-07 10:28:08,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:28:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17661 states. [2019-12-07 10:28:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17661 to 15058. [2019-12-07 10:28:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15058 states. [2019-12-07 10:28:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15058 states to 15058 states and 46883 transitions. [2019-12-07 10:28:08,709 INFO L78 Accepts]: Start accepts. Automaton has 15058 states and 46883 transitions. Word has length 66 [2019-12-07 10:28:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:08,709 INFO L462 AbstractCegarLoop]: Abstraction has 15058 states and 46883 transitions. [2019-12-07 10:28:08,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15058 states and 46883 transitions. [2019-12-07 10:28:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:08,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:08,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:08,722 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:08,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash 212975850, now seen corresponding path program 1 times [2019-12-07 10:28:08,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:08,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320142738] [2019-12-07 10:28:08,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:08,766 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 10:28:08,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320142738] [2019-12-07 10:28:08,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:08,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:28:08,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388825578] [2019-12-07 10:28:08,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:28:08,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:28:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:28:08,768 INFO L87 Difference]: Start difference. First operand 15058 states and 46883 transitions. Second operand 4 states. [2019-12-07 10:28:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:08,967 INFO L93 Difference]: Finished difference Result 25349 states and 79465 transitions. [2019-12-07 10:28:08,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:28:08,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 10:28:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:08,997 INFO L225 Difference]: With dead ends: 25349 [2019-12-07 10:28:08,997 INFO L226 Difference]: Without dead ends: 25349 [2019-12-07 10:28:08,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:28:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25349 states. [2019-12-07 10:28:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25349 to 16360. [2019-12-07 10:28:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16360 states. [2019-12-07 10:28:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16360 states to 16360 states and 51501 transitions. [2019-12-07 10:28:09,301 INFO L78 Accepts]: Start accepts. Automaton has 16360 states and 51501 transitions. Word has length 67 [2019-12-07 10:28:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:09,301 INFO L462 AbstractCegarLoop]: Abstraction has 16360 states and 51501 transitions. [2019-12-07 10:28:09,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:28:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 16360 states and 51501 transitions. [2019-12-07 10:28:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:09,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:09,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:09,315 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 868654749, now seen corresponding path program 1 times [2019-12-07 10:28:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:09,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222251879] [2019-12-07 10:28:09,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:09,356 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 10:28:09,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222251879] [2019-12-07 10:28:09,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:09,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:09,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129653015] [2019-12-07 10:28:09,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:28:09,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:09,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:28:09,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:28:09,357 INFO L87 Difference]: Start difference. First operand 16360 states and 51501 transitions. Second operand 4 states. [2019-12-07 10:28:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:09,456 INFO L93 Difference]: Finished difference Result 16360 states and 51332 transitions. [2019-12-07 10:28:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:28:09,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 10:28:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:09,478 INFO L225 Difference]: With dead ends: 16360 [2019-12-07 10:28:09,478 INFO L226 Difference]: Without dead ends: 16360 [2019-12-07 10:28:09,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 10:28:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16360 states. [2019-12-07 10:28:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16360 to 13772. [2019-12-07 10:28:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2019-12-07 10:28:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 42742 transitions. [2019-12-07 10:28:09,693 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 42742 transitions. Word has length 67 [2019-12-07 10:28:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:09,693 INFO L462 AbstractCegarLoop]: Abstraction has 13772 states and 42742 transitions. [2019-12-07 10:28:09,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:28:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 42742 transitions. [2019-12-07 10:28:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:09,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:09,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:09,705 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1605184731, now seen corresponding path program 1 times [2019-12-07 10:28:09,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127581868] [2019-12-07 10:28:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:09,770 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 10:28:09,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127581868] [2019-12-07 10:28:09,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:09,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:09,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021595955] [2019-12-07 10:28:09,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:28:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:28:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:28:09,771 INFO L87 Difference]: Start difference. First operand 13772 states and 42742 transitions. Second operand 4 states. [2019-12-07 10:28:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:09,835 INFO L93 Difference]: Finished difference Result 22136 states and 69426 transitions. [2019-12-07 10:28:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:28:09,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 10:28:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:09,858 INFO L225 Difference]: With dead ends: 22136 [2019-12-07 10:28:09,858 INFO L226 Difference]: Without dead ends: 19514 [2019-12-07 10:28:09,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 10:28:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2019-12-07 10:28:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 13541. [2019-12-07 10:28:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13541 states. [2019-12-07 10:28:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13541 states to 13541 states and 42041 transitions. [2019-12-07 10:28:10,101 INFO L78 Accepts]: Start accepts. Automaton has 13541 states and 42041 transitions. Word has length 67 [2019-12-07 10:28:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:10,101 INFO L462 AbstractCegarLoop]: Abstraction has 13541 states and 42041 transitions. [2019-12-07 10:28:10,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:28:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 13541 states and 42041 transitions. [2019-12-07 10:28:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:10,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:10,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:10,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 490650003, now seen corresponding path program 2 times [2019-12-07 10:28:10,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:10,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131373026] [2019-12-07 10:28:10,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:10,169 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 10:28:10,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131373026] [2019-12-07 10:28:10,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:10,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:28:10,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332092794] [2019-12-07 10:28:10,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:28:10,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:28:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:28:10,170 INFO L87 Difference]: Start difference. First operand 13541 states and 42041 transitions. Second operand 5 states. [2019-12-07 10:28:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:10,268 INFO L93 Difference]: Finished difference Result 30515 states and 96114 transitions. [2019-12-07 10:28:10,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:28:10,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 10:28:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:10,289 INFO L225 Difference]: With dead ends: 30515 [2019-12-07 10:28:10,290 INFO L226 Difference]: Without dead ends: 17863 [2019-12-07 10:28:10,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 10:28:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17863 states. [2019-12-07 10:28:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17863 to 12967. [2019-12-07 10:28:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12967 states. [2019-12-07 10:28:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12967 states to 12967 states and 40150 transitions. [2019-12-07 10:28:10,508 INFO L78 Accepts]: Start accepts. Automaton has 12967 states and 40150 transitions. Word has length 67 [2019-12-07 10:28:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:10,508 INFO L462 AbstractCegarLoop]: Abstraction has 12967 states and 40150 transitions. [2019-12-07 10:28:10,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:28:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12967 states and 40150 transitions. [2019-12-07 10:28:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:10,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:10,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:10,520 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 3 times [2019-12-07 10:28:10,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:10,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178453139] [2019-12-07 10:28:10,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:10,660 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 10:28:10,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178453139] [2019-12-07 10:28:10,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:10,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:28:10,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799017708] [2019-12-07 10:28:10,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:28:10,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:28:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:28:10,661 INFO L87 Difference]: Start difference. First operand 12967 states and 40150 transitions. Second operand 11 states. [2019-12-07 10:28:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:11,999 INFO L93 Difference]: Finished difference Result 28430 states and 87480 transitions. [2019-12-07 10:28:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:28:11,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 10:28:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:12,025 INFO L225 Difference]: With dead ends: 28430 [2019-12-07 10:28:12,025 INFO L226 Difference]: Without dead ends: 18533 [2019-12-07 10:28:12,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:28:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18533 states. [2019-12-07 10:28:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18533 to 15413. [2019-12-07 10:28:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15413 states. [2019-12-07 10:28:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 47363 transitions. [2019-12-07 10:28:12,262 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 47363 transitions. Word has length 67 [2019-12-07 10:28:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:12,262 INFO L462 AbstractCegarLoop]: Abstraction has 15413 states and 47363 transitions. [2019-12-07 10:28:12,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:28:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 47363 transitions. [2019-12-07 10:28:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:12,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:12,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:12,276 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 4 times [2019-12-07 10:28:12,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:12,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126735994] [2019-12-07 10:28:12,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:12,417 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 10:28:12,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126735994] [2019-12-07 10:28:12,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:12,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:28:12,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209428151] [2019-12-07 10:28:12,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:28:12,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:28:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:28:12,419 INFO L87 Difference]: Start difference. First operand 15413 states and 47363 transitions. Second operand 12 states. [2019-12-07 10:28:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:13,617 INFO L93 Difference]: Finished difference Result 23252 states and 70654 transitions. [2019-12-07 10:28:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:28:13,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 10:28:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:13,638 INFO L225 Difference]: With dead ends: 23252 [2019-12-07 10:28:13,638 INFO L226 Difference]: Without dead ends: 18257 [2019-12-07 10:28:13,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:28:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18257 states. [2019-12-07 10:28:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18257 to 15373. [2019-12-07 10:28:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-12-07 10:28:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 47235 transitions. [2019-12-07 10:28:13,916 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 47235 transitions. Word has length 67 [2019-12-07 10:28:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:13,916 INFO L462 AbstractCegarLoop]: Abstraction has 15373 states and 47235 transitions. [2019-12-07 10:28:13,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:28:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 47235 transitions. [2019-12-07 10:28:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:13,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:13,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:13,927 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 5 times [2019-12-07 10:28:13,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:13,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006421185] [2019-12-07 10:28:13,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:14,047 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 10:28:14,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006421185] [2019-12-07 10:28:14,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:14,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:28:14,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264391404] [2019-12-07 10:28:14,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:28:14,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:28:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:28:14,048 INFO L87 Difference]: Start difference. First operand 15373 states and 47235 transitions. Second operand 10 states. [2019-12-07 10:28:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:14,808 INFO L93 Difference]: Finished difference Result 39006 states and 120664 transitions. [2019-12-07 10:28:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:28:14,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 10:28:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:14,852 INFO L225 Difference]: With dead ends: 39006 [2019-12-07 10:28:14,853 INFO L226 Difference]: Without dead ends: 34403 [2019-12-07 10:28:14,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:28:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34403 states. [2019-12-07 10:28:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34403 to 19870. [2019-12-07 10:28:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19870 states. [2019-12-07 10:28:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19870 states to 19870 states and 61925 transitions. [2019-12-07 10:28:15,246 INFO L78 Accepts]: Start accepts. Automaton has 19870 states and 61925 transitions. Word has length 67 [2019-12-07 10:28:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:15,246 INFO L462 AbstractCegarLoop]: Abstraction has 19870 states and 61925 transitions. [2019-12-07 10:28:15,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:28:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 19870 states and 61925 transitions. [2019-12-07 10:28:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:15,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:15,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:15,262 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 6 times [2019-12-07 10:28:15,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:15,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271897818] [2019-12-07 10:28:15,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:15,536 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 10:28:15,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271897818] [2019-12-07 10:28:15,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:15,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:28:15,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429879406] [2019-12-07 10:28:15,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:28:15,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:28:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:28:15,537 INFO L87 Difference]: Start difference. First operand 19870 states and 61925 transitions. Second operand 14 states. [2019-12-07 10:28:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:21,279 INFO L93 Difference]: Finished difference Result 46170 states and 140581 transitions. [2019-12-07 10:28:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-12-07 10:28:21,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 10:28:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:21,322 INFO L225 Difference]: With dead ends: 46170 [2019-12-07 10:28:21,322 INFO L226 Difference]: Without dead ends: 39046 [2019-12-07 10:28:21,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1202, Invalid=7728, Unknown=0, NotChecked=0, Total=8930 [2019-12-07 10:28:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39046 states. [2019-12-07 10:28:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39046 to 21301. [2019-12-07 10:28:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21301 states. [2019-12-07 10:28:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21301 states to 21301 states and 65716 transitions. [2019-12-07 10:28:21,727 INFO L78 Accepts]: Start accepts. Automaton has 21301 states and 65716 transitions. Word has length 67 [2019-12-07 10:28:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:21,727 INFO L462 AbstractCegarLoop]: Abstraction has 21301 states and 65716 transitions. [2019-12-07 10:28:21,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:28:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 21301 states and 65716 transitions. [2019-12-07 10:28:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:21,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:21,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:21,746 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 7 times [2019-12-07 10:28:21,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:21,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112605911] [2019-12-07 10:28:21,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:21,933 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 10:28:21,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112605911] [2019-12-07 10:28:21,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:21,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:28:21,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426933783] [2019-12-07 10:28:21,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:28:21,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:28:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:28:21,935 INFO L87 Difference]: Start difference. First operand 21301 states and 65716 transitions. Second operand 13 states. [2019-12-07 10:28:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:23,786 INFO L93 Difference]: Finished difference Result 51406 states and 160860 transitions. [2019-12-07 10:28:23,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 10:28:23,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 10:28:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:23,855 INFO L225 Difference]: With dead ends: 51406 [2019-12-07 10:28:23,856 INFO L226 Difference]: Without dead ends: 50387 [2019-12-07 10:28:23,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=568, Invalid=2854, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 10:28:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50387 states. [2019-12-07 10:28:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50387 to 21299. [2019-12-07 10:28:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21299 states. [2019-12-07 10:28:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21299 states to 21299 states and 65717 transitions. [2019-12-07 10:28:24,339 INFO L78 Accepts]: Start accepts. Automaton has 21299 states and 65717 transitions. Word has length 67 [2019-12-07 10:28:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:24,339 INFO L462 AbstractCegarLoop]: Abstraction has 21299 states and 65717 transitions. [2019-12-07 10:28:24,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:28:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21299 states and 65717 transitions. [2019-12-07 10:28:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:24,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:24,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:24,401 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 961817837, now seen corresponding path program 8 times [2019-12-07 10:28:24,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:24,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816356165] [2019-12-07 10:28:24,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:24,689 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 10:28:24,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816356165] [2019-12-07 10:28:24,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:24,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:28:24,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408617642] [2019-12-07 10:28:24,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:28:24,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:24,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:28:24,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:28:24,690 INFO L87 Difference]: Start difference. First operand 21299 states and 65717 transitions. Second operand 15 states. [2019-12-07 10:28:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:30,870 INFO L93 Difference]: Finished difference Result 61904 states and 189249 transitions. [2019-12-07 10:28:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-12-07 10:28:30,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 10:28:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:30,922 INFO L225 Difference]: With dead ends: 61904 [2019-12-07 10:28:30,922 INFO L226 Difference]: Without dead ends: 47677 [2019-12-07 10:28:30,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3984 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1541, Invalid=9171, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 10:28:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47677 states. [2019-12-07 10:28:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47677 to 20068. [2019-12-07 10:28:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20068 states. [2019-12-07 10:28:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20068 states to 20068 states and 61847 transitions. [2019-12-07 10:28:31,402 INFO L78 Accepts]: Start accepts. Automaton has 20068 states and 61847 transitions. Word has length 67 [2019-12-07 10:28:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:31,402 INFO L462 AbstractCegarLoop]: Abstraction has 20068 states and 61847 transitions. [2019-12-07 10:28:31,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:28:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20068 states and 61847 transitions. [2019-12-07 10:28:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:31,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:31,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:31,420 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1186663551, now seen corresponding path program 9 times [2019-12-07 10:28:31,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:31,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732308169] [2019-12-07 10:28:31,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:31,473 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 10:28:31,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732308169] [2019-12-07 10:28:31,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:31,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:28:31,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327845206] [2019-12-07 10:28:31,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:28:31,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:28:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:28:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:28:31,474 INFO L87 Difference]: Start difference. First operand 20068 states and 61847 transitions. Second operand 6 states. [2019-12-07 10:28:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:31,830 INFO L93 Difference]: Finished difference Result 51026 states and 156481 transitions. [2019-12-07 10:28:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:28:31,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 10:28:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:31,881 INFO L225 Difference]: With dead ends: 51026 [2019-12-07 10:28:31,881 INFO L226 Difference]: Without dead ends: 43386 [2019-12-07 10:28:31,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:28:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43386 states. [2019-12-07 10:28:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43386 to 19557. [2019-12-07 10:28:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19557 states. [2019-12-07 10:28:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19557 states to 19557 states and 59891 transitions. [2019-12-07 10:28:32,304 INFO L78 Accepts]: Start accepts. Automaton has 19557 states and 59891 transitions. Word has length 67 [2019-12-07 10:28:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:32,304 INFO L462 AbstractCegarLoop]: Abstraction has 19557 states and 59891 transitions. [2019-12-07 10:28:32,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:28:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19557 states and 59891 transitions. [2019-12-07 10:28:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:28:32,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:32,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:32,321 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 10 times [2019-12-07 10:28:32,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:28:32,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774543675] [2019-12-07 10:28:32,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:28:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:28:32,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:28:32,390 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:28:32,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26|) |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26| 1)) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1397~0.base_26|) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26|) 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1397~0.base_26| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1397~0.offset=|v_ULTIMATE.start_main_~#t1397~0.offset_19|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_12|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1397~0.base=|v_ULTIMATE.start_main_~#t1397~0.base_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t1397~0.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1398~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1397~0.base] because there is no mapped edge [2019-12-07 10:28:32,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1398~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1398~0.base_9|) (= |v_ULTIMATE.start_main_~#t1398~0.offset_8| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9|) |v_ULTIMATE.start_main_~#t1398~0.offset_8| 1)) |v_#memory_int_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t1398~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_8|, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.offset, ULTIMATE.start_main_~#t1398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:28:32,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In-427288204 ~z$w_buff1~0_Out-427288204) (= ~z$w_buff1_used~0_Out-427288204 ~z$w_buff0_used~0_In-427288204) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-427288204| P0Thread1of1ForFork0_~arg.offset_Out-427288204) (= 1 ~z$w_buff0_used~0_Out-427288204) (= 1 ~z$w_buff0~0_Out-427288204) (= P0Thread1of1ForFork0_~arg.base_Out-427288204 |P0Thread1of1ForFork0_#in~arg.base_In-427288204|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-427288204 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out-427288204 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-427288204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-427288204, ~z$w_buff0~0=~z$w_buff0~0_In-427288204, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-427288204|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-427288204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-427288204, ~z$w_buff0~0=~z$w_buff0~0_Out-427288204, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-427288204, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-427288204|, ~z$w_buff1~0=~z$w_buff1~0_Out-427288204, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-427288204, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-427288204} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:28:32,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1399~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1399~0.base_11| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11|) |v_ULTIMATE.start_main_~#t1399~0.offset_9| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1399~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_11|, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 10:28:32,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1322796749 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1322796749 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-1322796749| |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In-1322796749 |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|)) (and (= ~z~0_In-1322796749 |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1322796749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322796749, ~z$w_buff1~0=~z$w_buff1~0_In-1322796749, ~z~0=~z~0_In-1322796749} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1322796749|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1322796749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322796749, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1322796749|, ~z$w_buff1~0=~z$w_buff1~0_In-1322796749, ~z~0=~z~0_In-1322796749} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 10:28:32,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1215426269 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1215426269 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1215426269|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1215426269| ~z$w_buff0_used~0_In-1215426269)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215426269, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1215426269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215426269, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1215426269|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1215426269} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:28:32,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-97293704 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-97293704 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-97293704 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-97293704 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-97293704 |P1Thread1of1ForFork1_#t~ite12_Out-97293704|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-97293704|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-97293704, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-97293704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-97293704, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-97293704} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-97293704, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-97293704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-97293704, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-97293704|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-97293704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:28:32,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In394453391 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In394453391 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out394453391|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out394453391| ~z$r_buff0_thd2~0_In394453391)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In394453391, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In394453391} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In394453391, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out394453391|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In394453391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:28:32,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1517414994 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out1517414994| ~z$w_buff1~0_In1517414994) (= |P2Thread1of1ForFork2_#t~ite23_In1517414994| |P2Thread1of1ForFork2_#t~ite23_Out1517414994|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out1517414994| |P2Thread1of1ForFork2_#t~ite23_Out1517414994|) (= ~z$w_buff1~0_In1517414994 |P2Thread1of1ForFork2_#t~ite23_Out1517414994|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1517414994 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1517414994 256))) (= 0 (mod ~z$w_buff0_used~0_In1517414994 256)) (and (= (mod ~z$w_buff1_used~0_In1517414994 256) 0) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1517414994|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517414994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1517414994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517414994, ~z$w_buff1~0=~z$w_buff1~0_In1517414994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1517414994, ~weak$$choice2~0=~weak$$choice2~0_In1517414994} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1517414994|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1517414994|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517414994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1517414994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517414994, ~z$w_buff1~0=~z$w_buff1~0_In1517414994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1517414994, ~weak$$choice2~0=~weak$$choice2~0_In1517414994} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:28:32,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In432938525 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In432938525| |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out432938525| ~z$w_buff0_used~0_In432938525)) (and (= ~z$w_buff0_used~0_In432938525 |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (= |P2Thread1of1ForFork2_#t~ite27_Out432938525| |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In432938525 256)))) (or (= (mod ~z$w_buff0_used~0_In432938525 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In432938525 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In432938525 256) 0) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In432938525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432938525, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In432938525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432938525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In432938525, ~weak$$choice2~0=~weak$$choice2~0_In432938525} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out432938525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432938525, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In432938525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432938525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In432938525, ~weak$$choice2~0=~weak$$choice2~0_In432938525, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out432938525|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:28:32,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In888082532 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In888082532 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In888082532 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In888082532 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out888082532| ~z$r_buff1_thd2~0_In888082532) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out888082532|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In888082532, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In888082532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888082532, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In888082532} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In888082532, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In888082532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888082532, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out888082532|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In888082532} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:28:32,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:28:32,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1488307275 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1488307275 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1488307275 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1488307275 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1488307275 256))))) (= |P2Thread1of1ForFork2_#t~ite30_Out-1488307275| |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) (= ~z$w_buff1_used~0_In-1488307275 |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-1488307275| |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) (= |P2Thread1of1ForFork2_#t~ite30_Out-1488307275| ~z$w_buff1_used~0_In-1488307275)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488307275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488307275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488307275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488307275, ~weak$$choice2~0=~weak$$choice2~0_In-1488307275, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1488307275|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1488307275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488307275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488307275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488307275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488307275, ~weak$$choice2~0=~weak$$choice2~0_In-1488307275, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1488307275|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:28:32,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:28:32,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:28:32,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1765222111 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1765222111 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1765222111 |P0Thread1of1ForFork0_#t~ite5_Out-1765222111|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1765222111|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765222111, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1765222111} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1765222111|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765222111, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1765222111} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:28:32,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1799248589 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1799248589 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1799248589 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1799248589 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1799248589 |P0Thread1of1ForFork0_#t~ite6_Out1799248589|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out1799248589| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1799248589, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799248589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799248589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799248589} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1799248589|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1799248589, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799248589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799248589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799248589} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:28:32,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1689744535 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1689744535 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_In-1689744535 ~z$r_buff0_thd1~0_Out-1689744535))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd1~0_Out-1689744535 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1689744535, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1689744535} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1689744535, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1689744535|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1689744535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:28:32,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1799826042 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1799826042 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1799826042 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1799826042 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1799826042| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1799826042| ~z$r_buff1_thd1~0_In1799826042)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1799826042, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799826042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799826042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799826042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1799826042, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1799826042|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799826042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799826042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799826042} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:28:32,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:28:32,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1131689308 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1131689308 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1131689308| |P2Thread1of1ForFork2_#t~ite38_Out-1131689308|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-1131689308| ~z$w_buff1~0_In-1131689308)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1131689308| ~z~0_In-1131689308) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1131689308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131689308, ~z$w_buff1~0=~z$w_buff1~0_In-1131689308, ~z~0=~z~0_In-1131689308} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1131689308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131689308, ~z$w_buff1~0=~z$w_buff1~0_In-1131689308, ~z~0=~z~0_In-1131689308, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1131689308|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1131689308|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:28:32,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-83626515 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-83626515 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-83626515|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-83626515 |P2Thread1of1ForFork2_#t~ite40_Out-83626515|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-83626515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-83626515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-83626515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-83626515, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-83626515|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:28:32,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1337825695 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1337825695 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1337825695 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1337825695 256)))) (or (and (= ~z$w_buff1_used~0_In1337825695 |P2Thread1of1ForFork2_#t~ite41_Out1337825695|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1337825695|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1337825695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1337825695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337825695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1337825695} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1337825695|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337825695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1337825695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337825695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1337825695} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:28:32,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-647316138 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-647316138 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-647316138| ~z$r_buff0_thd3~0_In-647316138) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-647316138| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-647316138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-647316138} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-647316138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647316138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-647316138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:28:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1383754142 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1383754142 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1383754142 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1383754142 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1383754142|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1383754142 |P2Thread1of1ForFork2_#t~ite43_Out-1383754142|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383754142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1383754142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383754142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1383754142} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383754142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1383754142, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1383754142|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383754142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1383754142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:28:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:28:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:28:32,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1451835162 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| |ULTIMATE.start_main_#t~ite48_Out-1451835162|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1451835162 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| ~z~0_In-1451835162)) (and (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| ~z$w_buff1~0_In-1451835162) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1451835162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1451835162, ~z$w_buff1~0=~z$w_buff1~0_In-1451835162, ~z~0=~z~0_In-1451835162} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1451835162, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1451835162|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1451835162, ~z$w_buff1~0=~z$w_buff1~0_In-1451835162, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1451835162|, ~z~0=~z~0_In-1451835162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:28:32,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In424050578 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In424050578 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out424050578| 0)) (and (= ~z$w_buff0_used~0_In424050578 |ULTIMATE.start_main_#t~ite49_Out424050578|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In424050578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424050578} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In424050578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424050578, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out424050578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:28:32,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1393082843 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1393082843 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1393082843 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1393082843 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1393082843| ~z$w_buff1_used~0_In1393082843) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite50_Out1393082843| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393082843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393082843, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1393082843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1393082843} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1393082843|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393082843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393082843, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1393082843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1393082843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:28:32,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In339029423 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In339029423 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In339029423 |ULTIMATE.start_main_#t~ite51_Out339029423|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out339029423|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339029423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339029423} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339029423, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out339029423|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339029423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:28:32,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-194702549 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-194702549 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-194702549 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-194702549 256)))) (or (and (= ~z$r_buff1_thd0~0_In-194702549 |ULTIMATE.start_main_#t~ite52_Out-194702549|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-194702549|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194702549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194702549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194702549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194702549} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-194702549|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194702549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194702549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194702549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194702549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:28:32,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_47 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:28:32,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:28:32 BasicIcfg [2019-12-07 10:28:32,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:28:32,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:28:32,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:28:32,468 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:28:32,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:26:28" (3/4) ... [2019-12-07 10:28:32,471 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:28:32,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26|) |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26| 1)) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1397~0.base_26|) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26|) 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1397~0.base_26| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1397~0.offset=|v_ULTIMATE.start_main_~#t1397~0.offset_19|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_12|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1397~0.base=|v_ULTIMATE.start_main_~#t1397~0.base_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t1397~0.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1398~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1397~0.base] because there is no mapped edge [2019-12-07 10:28:32,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1398~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1398~0.base_9|) (= |v_ULTIMATE.start_main_~#t1398~0.offset_8| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9|) |v_ULTIMATE.start_main_~#t1398~0.offset_8| 1)) |v_#memory_int_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t1398~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_8|, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.offset, ULTIMATE.start_main_~#t1398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:28:32,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In-427288204 ~z$w_buff1~0_Out-427288204) (= ~z$w_buff1_used~0_Out-427288204 ~z$w_buff0_used~0_In-427288204) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-427288204| P0Thread1of1ForFork0_~arg.offset_Out-427288204) (= 1 ~z$w_buff0_used~0_Out-427288204) (= 1 ~z$w_buff0~0_Out-427288204) (= P0Thread1of1ForFork0_~arg.base_Out-427288204 |P0Thread1of1ForFork0_#in~arg.base_In-427288204|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-427288204 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out-427288204 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-427288204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-427288204, ~z$w_buff0~0=~z$w_buff0~0_In-427288204, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-427288204|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-427288204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-427288204, ~z$w_buff0~0=~z$w_buff0~0_Out-427288204, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-427288204, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-427288204, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-427288204|, ~z$w_buff1~0=~z$w_buff1~0_Out-427288204, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-427288204, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-427288204|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-427288204} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:28:32,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1399~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1399~0.base_11| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11|) |v_ULTIMATE.start_main_~#t1399~0.offset_9| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1399~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_11|, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 10:28:32,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1322796749 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1322796749 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-1322796749| |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In-1322796749 |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|)) (and (= ~z~0_In-1322796749 |P1Thread1of1ForFork1_#t~ite9_Out-1322796749|) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1322796749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322796749, ~z$w_buff1~0=~z$w_buff1~0_In-1322796749, ~z~0=~z~0_In-1322796749} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1322796749|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1322796749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322796749, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1322796749|, ~z$w_buff1~0=~z$w_buff1~0_In-1322796749, ~z~0=~z~0_In-1322796749} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 10:28:32,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1215426269 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1215426269 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1215426269|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1215426269| ~z$w_buff0_used~0_In-1215426269)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215426269, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1215426269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215426269, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1215426269|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1215426269} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:28:32,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-97293704 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-97293704 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-97293704 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-97293704 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-97293704 |P1Thread1of1ForFork1_#t~ite12_Out-97293704|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-97293704|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-97293704, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-97293704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-97293704, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-97293704} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-97293704, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-97293704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-97293704, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-97293704|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-97293704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:28:32,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In394453391 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In394453391 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out394453391|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out394453391| ~z$r_buff0_thd2~0_In394453391)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In394453391, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In394453391} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In394453391, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out394453391|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In394453391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:28:32,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1517414994 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out1517414994| ~z$w_buff1~0_In1517414994) (= |P2Thread1of1ForFork2_#t~ite23_In1517414994| |P2Thread1of1ForFork2_#t~ite23_Out1517414994|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out1517414994| |P2Thread1of1ForFork2_#t~ite23_Out1517414994|) (= ~z$w_buff1~0_In1517414994 |P2Thread1of1ForFork2_#t~ite23_Out1517414994|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1517414994 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1517414994 256))) (= 0 (mod ~z$w_buff0_used~0_In1517414994 256)) (and (= (mod ~z$w_buff1_used~0_In1517414994 256) 0) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1517414994|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517414994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1517414994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517414994, ~z$w_buff1~0=~z$w_buff1~0_In1517414994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1517414994, ~weak$$choice2~0=~weak$$choice2~0_In1517414994} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1517414994|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1517414994|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517414994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1517414994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517414994, ~z$w_buff1~0=~z$w_buff1~0_In1517414994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1517414994, ~weak$$choice2~0=~weak$$choice2~0_In1517414994} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:28:32,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In432938525 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In432938525| |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out432938525| ~z$w_buff0_used~0_In432938525)) (and (= ~z$w_buff0_used~0_In432938525 |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (= |P2Thread1of1ForFork2_#t~ite27_Out432938525| |P2Thread1of1ForFork2_#t~ite26_Out432938525|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In432938525 256)))) (or (= (mod ~z$w_buff0_used~0_In432938525 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In432938525 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In432938525 256) 0) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In432938525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432938525, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In432938525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432938525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In432938525, ~weak$$choice2~0=~weak$$choice2~0_In432938525} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out432938525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432938525, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In432938525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432938525, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In432938525, ~weak$$choice2~0=~weak$$choice2~0_In432938525, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out432938525|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:28:32,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In888082532 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In888082532 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In888082532 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In888082532 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out888082532| ~z$r_buff1_thd2~0_In888082532) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out888082532|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In888082532, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In888082532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888082532, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In888082532} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In888082532, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In888082532, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888082532, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out888082532|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In888082532} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:28:32,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:28:32,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1488307275 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1488307275 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1488307275 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1488307275 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1488307275 256))))) (= |P2Thread1of1ForFork2_#t~ite30_Out-1488307275| |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) (= ~z$w_buff1_used~0_In-1488307275 |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-1488307275| |P2Thread1of1ForFork2_#t~ite29_Out-1488307275|) (= |P2Thread1of1ForFork2_#t~ite30_Out-1488307275| ~z$w_buff1_used~0_In-1488307275)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488307275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488307275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488307275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488307275, ~weak$$choice2~0=~weak$$choice2~0_In-1488307275, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1488307275|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1488307275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488307275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488307275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488307275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488307275, ~weak$$choice2~0=~weak$$choice2~0_In-1488307275, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1488307275|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:28:32,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 10:28:32,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:28:32,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1765222111 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1765222111 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1765222111 |P0Thread1of1ForFork0_#t~ite5_Out-1765222111|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1765222111|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765222111, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1765222111} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1765222111|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765222111, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1765222111} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:28:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1799248589 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1799248589 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1799248589 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1799248589 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1799248589 |P0Thread1of1ForFork0_#t~ite6_Out1799248589|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out1799248589| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1799248589, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799248589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799248589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799248589} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1799248589|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1799248589, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799248589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799248589, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799248589} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:28:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1689744535 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1689744535 256) 0)) (.cse1 (= ~z$r_buff0_thd1~0_In-1689744535 ~z$r_buff0_thd1~0_Out-1689744535))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd1~0_Out-1689744535 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1689744535, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1689744535} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1689744535, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1689744535|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1689744535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:28:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1799826042 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1799826042 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1799826042 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1799826042 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1799826042| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1799826042| ~z$r_buff1_thd1~0_In1799826042)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1799826042, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799826042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799826042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799826042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1799826042, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1799826042|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1799826042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1799826042, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1799826042} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:28:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:28:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1131689308 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1131689308 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1131689308| |P2Thread1of1ForFork2_#t~ite38_Out-1131689308|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-1131689308| ~z$w_buff1~0_In-1131689308)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1131689308| ~z~0_In-1131689308) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1131689308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131689308, ~z$w_buff1~0=~z$w_buff1~0_In-1131689308, ~z~0=~z~0_In-1131689308} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1131689308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131689308, ~z$w_buff1~0=~z$w_buff1~0_In-1131689308, ~z~0=~z~0_In-1131689308, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1131689308|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1131689308|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:28:32,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-83626515 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-83626515 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-83626515|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-83626515 |P2Thread1of1ForFork2_#t~ite40_Out-83626515|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-83626515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-83626515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-83626515, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-83626515, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-83626515|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:28:32,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1337825695 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1337825695 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1337825695 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1337825695 256)))) (or (and (= ~z$w_buff1_used~0_In1337825695 |P2Thread1of1ForFork2_#t~ite41_Out1337825695|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1337825695|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1337825695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1337825695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337825695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1337825695} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1337825695|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337825695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1337825695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337825695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1337825695} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:28:32,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-647316138 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-647316138 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-647316138| ~z$r_buff0_thd3~0_In-647316138) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-647316138| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-647316138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-647316138} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-647316138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647316138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-647316138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:28:32,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1383754142 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1383754142 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1383754142 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1383754142 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1383754142|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1383754142 |P2Thread1of1ForFork2_#t~ite43_Out-1383754142|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383754142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1383754142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383754142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1383754142} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383754142, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1383754142, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1383754142|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383754142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1383754142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:28:32,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:28:32,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:28:32,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1451835162 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| |ULTIMATE.start_main_#t~ite48_Out-1451835162|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1451835162 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| ~z~0_In-1451835162)) (and (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1451835162| ~z$w_buff1~0_In-1451835162) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1451835162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1451835162, ~z$w_buff1~0=~z$w_buff1~0_In-1451835162, ~z~0=~z~0_In-1451835162} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1451835162, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1451835162|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1451835162, ~z$w_buff1~0=~z$w_buff1~0_In-1451835162, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1451835162|, ~z~0=~z~0_In-1451835162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:28:32,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In424050578 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In424050578 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out424050578| 0)) (and (= ~z$w_buff0_used~0_In424050578 |ULTIMATE.start_main_#t~ite49_Out424050578|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In424050578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424050578} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In424050578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424050578, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out424050578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:28:32,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1393082843 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1393082843 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1393082843 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1393082843 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1393082843| ~z$w_buff1_used~0_In1393082843) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite50_Out1393082843| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393082843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393082843, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1393082843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1393082843} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1393082843|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393082843, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393082843, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1393082843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1393082843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:28:32,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In339029423 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In339029423 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In339029423 |ULTIMATE.start_main_#t~ite51_Out339029423|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out339029423|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339029423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339029423} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In339029423, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out339029423|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In339029423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:28:32,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-194702549 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-194702549 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-194702549 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-194702549 256)))) (or (and (= ~z$r_buff1_thd0~0_In-194702549 |ULTIMATE.start_main_#t~ite52_Out-194702549|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-194702549|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194702549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194702549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194702549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194702549} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-194702549|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194702549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194702549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194702549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194702549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:28:32,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_21 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_47 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:28:32,550 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd921949-2c36-46ca-b100-810f13f0de42/bin/uautomizer/witness.graphml [2019-12-07 10:28:32,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:28:32,551 INFO L168 Benchmark]: Toolchain (without parser) took 124849.34 ms. Allocated memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: 7.2 GB). Free memory was 942.0 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,552 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:28:32,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,553 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,553 INFO L168 Benchmark]: RCFGBuilder took 421.81 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,553 INFO L168 Benchmark]: TraceAbstraction took 123891.59 ms. Allocated memory was 1.1 GB in the beginning and 8.2 GB in the end (delta: 7.1 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,554 INFO L168 Benchmark]: Witness Printer took 81.94 ms. Allocated memory is still 8.2 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:32,556 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 421.81 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 123891.59 ms. Allocated memory was 1.1 GB in the beginning and 8.2 GB in the end (delta: 7.1 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 81.94 ms. Allocated memory is still 8.2 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6518 SDtfs, 8661 SDslu, 23141 SDs, 0 SdLazy, 20658 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 37 SyntacticMatches, 21 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8910 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272392occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 70.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 311868 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1253 NumberOfCodeBlocks, 1253 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1159 ConstructedInterpolants, 0 QuantifiedInterpolants, 353595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...