./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_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_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/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 dd3832798e2bb90e7c7406ebf268c420bdae9416 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:01:38,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:01:38,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:01:38,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:01:38,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:01:38,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:01:38,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:01:38,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:01:38,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:01:38,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:01:38,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:01:38,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:01:38,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:01:38,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:01:38,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:01:38,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:01:38,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:01:38,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:01:38,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:01:38,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:01:38,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:01:38,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:01:38,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:01:38,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:01:38,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:01:38,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:01:38,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:01:38,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:01:38,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:01:38,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:01:38,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:01:38,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:01:38,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:01:38,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:01:38,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:01:38,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:01:38,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:01:38,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:01:38,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:01:38,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:01:38,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:01:38,119 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:01:38,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:01:38,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:01:38,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:01:38,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:01:38,129 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:01:38,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:01:38,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:01:38,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:01:38,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:01:38,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:01:38,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:01:38,133 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_c25fac37-dde0-4df4-b1e7-1dab63b2b701/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 -> dd3832798e2bb90e7c7406ebf268c420bdae9416 [2019-12-07 11:01:38,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:01:38,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:01:38,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:01:38,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:01:38,246 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:01:38,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe005_rmo.oepc.i [2019-12-07 11:01:38,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/data/9e96ee685/6f49f22267cb4523b63a5f6e1f661ea6/FLAG47e25051d [2019-12-07 11:01:38,755 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:01:38,755 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/sv-benchmarks/c/pthread-wmm/safe005_rmo.oepc.i [2019-12-07 11:01:38,765 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/data/9e96ee685/6f49f22267cb4523b63a5f6e1f661ea6/FLAG47e25051d [2019-12-07 11:01:39,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/data/9e96ee685/6f49f22267cb4523b63a5f6e1f661ea6 [2019-12-07 11:01:39,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:01:39,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:01:39,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:39,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:01:39,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:01:39,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39, skipping insertion in model container [2019-12-07 11:01:39,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:01:39,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:01:39,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:39,594 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:01:39,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:01:39,676 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:01:39,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39 WrapperNode [2019-12-07 11:01:39,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:01:39,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:39,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:01:39,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:01:39,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:01:39,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:01:39,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:01:39,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:01:39,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... [2019-12-07 11:01:39,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:01:39,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:01:39,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:01:39,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:01:39,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/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 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:01:39,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:01:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:01:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:01:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:01:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:01:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:01:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:01:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:01:39,780 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 11:01:40,118 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:01:40,119 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:01:40,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:40 BoogieIcfgContainer [2019-12-07 11:01:40,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:01:40,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:01:40,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:01:40,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:01:40,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:01:39" (1/3) ... [2019-12-07 11:01:40,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de9d707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:40, skipping insertion in model container [2019-12-07 11:01:40,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:01:39" (2/3) ... [2019-12-07 11:01:40,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de9d707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:01:40, skipping insertion in model container [2019-12-07 11:01:40,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:40" (3/3) ... [2019-12-07 11:01:40,124 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_rmo.oepc.i [2019-12-07 11:01:40,131 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:01:40,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:01:40,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:01:40,136 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:01:40,188 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:01:40,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:01:40,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:01:40,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:01:40,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:01:40,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:01:40,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:01:40,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:01:40,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:01:40,212 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 11:01:40,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 11:01:40,271 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 11:01:40,271 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:40,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:01:40,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 11:01:40,332 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 11:01:40,332 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:01:40,338 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:01:40,353 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 11:01:40,354 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:01:43,420 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 11:01:43,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-07 11:01:43,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 11:01:43,563 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 11:01:53,548 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 11:01:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 11:01:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:01:53,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:53,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:01:53,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-07 11:01:53,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:53,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692051307] [2019-12-07 11:01:53,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:53,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692051307] [2019-12-07 11:01:53,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:53,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:01:53,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545904239] [2019-12-07 11:01:53,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:01:53,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:01:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:53,720 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 11:01:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:54,285 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 11:01:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:01:54,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:01:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:54,743 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 11:01:54,743 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 11:01:54,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:01:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 11:01:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 11:01:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 11:01:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 11:01:59,212 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 11:01:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:59,213 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 11:01:59,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:01:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 11:01:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:01:59,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:59,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:59,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-07 11:01:59,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:59,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383229816] [2019-12-07 11:01:59,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:01:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383229816] [2019-12-07 11:01:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:59,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:01:59,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148867090] [2019-12-07 11:01:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:59,285 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 11:01:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:59,969 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 11:01:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:59,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:01:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:00,346 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 11:02:00,346 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 11:02:00,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 11:02:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 11:02:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 11:02:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 11:02:07,644 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 11:02:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:07,645 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 11:02:07,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 11:02:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:02:07,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:07,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:07,648 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-07 11:02:07,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:07,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904543427] [2019-12-07 11:02:07,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:07,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904543427] [2019-12-07 11:02:07,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:07,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:07,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958262210] [2019-12-07 11:02:07,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:07,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:07,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:07,709 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 11:02:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:07,836 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-07 11:02:07,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:07,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:02:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:07,907 INFO L225 Difference]: With dead ends: 36525 [2019-12-07 11:02:07,908 INFO L226 Difference]: Without dead ends: 28771 [2019-12-07 11:02:07,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-07 11:02:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-07 11:02:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-07 11:02:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-07 11:02:08,417 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-07 11:02:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:08,418 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-07 11:02:08,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-07 11:02:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:02:08,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:08,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:08,419 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-07 11:02:08,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:08,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938373150] [2019-12-07 11:02:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:08,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938373150] [2019-12-07 11:02:08,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:08,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:08,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388714870] [2019-12-07 11:02:08,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:08,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:08,447 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 3 states. [2019-12-07 11:02:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:08,587 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-07 11:02:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:08,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 11:02:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:08,669 INFO L225 Difference]: With dead ends: 42081 [2019-12-07 11:02:08,669 INFO L226 Difference]: Without dead ends: 42081 [2019-12-07 11:02:08,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-07 11:02:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-07 11:02:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-07 11:02:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-07 11:02:09,301 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-07 11:02:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:09,301 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-07 11:02:09,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-07 11:02:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:02:09,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:09,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:09,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-07 11:02:09,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:09,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729787048] [2019-12-07 11:02:09,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:09,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729787048] [2019-12-07 11:02:09,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:09,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:09,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676162412] [2019-12-07 11:02:09,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:09,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:09,338 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 4 states. [2019-12-07 11:02:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:09,547 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-07 11:02:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:09,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:02:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:09,610 INFO L225 Difference]: With dead ends: 39611 [2019-12-07 11:02:09,610 INFO L226 Difference]: Without dead ends: 39522 [2019-12-07 11:02:09,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-07 11:02:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-07 11:02:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-07 11:02:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-07 11:02:10,445 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-07 11:02:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:10,445 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-07 11:02:10,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-07 11:02:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:02:10,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:10,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:10,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-07 11:02:10,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:10,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161820453] [2019-12-07 11:02:10,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:10,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161820453] [2019-12-07 11:02:10,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:10,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:10,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596390663] [2019-12-07 11:02:10,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:10,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:10,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:10,478 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 4 states. [2019-12-07 11:02:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:10,704 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-07 11:02:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:10,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:02:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:10,767 INFO L225 Difference]: With dead ends: 42436 [2019-12-07 11:02:10,767 INFO L226 Difference]: Without dead ends: 42329 [2019-12-07 11:02:10,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-07 11:02:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-07 11:02:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-07 11:02:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-07 11:02:11,418 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-07 11:02:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:11,418 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-07 11:02:11,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-07 11:02:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:02:11,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:11,427 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 11:02:11,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-07 11:02:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:11,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365165279] [2019-12-07 11:02:11,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:11,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365165279] [2019-12-07 11:02:11,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:11,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511266859] [2019-12-07 11:02:11,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:11,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:11,469 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-07 11:02:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:11,854 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-07 11:02:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:02:11,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:02:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:11,924 INFO L225 Difference]: With dead ends: 48205 [2019-12-07 11:02:11,925 INFO L226 Difference]: Without dead ends: 48029 [2019-12-07 11:02:11,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-07 11:02:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-07 11:02:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-07 11:02:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-07 11:02:12,626 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-07 11:02:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:12,626 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-07 11:02:12,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-07 11:02:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:02:12,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:12,634 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 11:02:12,634 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-07 11:02:12,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:12,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427805177] [2019-12-07 11:02:12,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:12,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427805177] [2019-12-07 11:02:12,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:12,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:12,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404250992] [2019-12-07 11:02:12,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:12,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:12,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:12,686 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 5 states. [2019-12-07 11:02:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:13,130 INFO L93 Difference]: Finished difference Result 49034 states and 160234 transitions. [2019-12-07 11:02:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:02:13,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:02:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:13,199 INFO L225 Difference]: With dead ends: 49034 [2019-12-07 11:02:13,199 INFO L226 Difference]: Without dead ends: 48752 [2019-12-07 11:02:13,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48752 states. [2019-12-07 11:02:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48752 to 34955. [2019-12-07 11:02:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-07 11:02:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 116069 transitions. [2019-12-07 11:02:13,870 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 116069 transitions. Word has length 22 [2019-12-07 11:02:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:13,870 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 116069 transitions. [2019-12-07 11:02:13,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 116069 transitions. [2019-12-07 11:02:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:02:13,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:13,882 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 11:02:13,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-07 11:02:13,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:13,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678451770] [2019-12-07 11:02:13,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:13,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678451770] [2019-12-07 11:02:13,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:13,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:13,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901687049] [2019-12-07 11:02:13,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:13,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:13,928 INFO L87 Difference]: Start difference. First operand 34955 states and 116069 transitions. Second operand 5 states. [2019-12-07 11:02:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:14,269 INFO L93 Difference]: Finished difference Result 48013 states and 156239 transitions. [2019-12-07 11:02:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:02:14,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:02:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:14,339 INFO L225 Difference]: With dead ends: 48013 [2019-12-07 11:02:14,339 INFO L226 Difference]: Without dead ends: 47985 [2019-12-07 11:02:14,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 11:02:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47985 states. [2019-12-07 11:02:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47985 to 39324. [2019-12-07 11:02:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39324 states. [2019-12-07 11:02:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39324 states to 39324 states and 129687 transitions. [2019-12-07 11:02:15,061 INFO L78 Accepts]: Start accepts. Automaton has 39324 states and 129687 transitions. Word has length 25 [2019-12-07 11:02:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:15,062 INFO L462 AbstractCegarLoop]: Abstraction has 39324 states and 129687 transitions. [2019-12-07 11:02:15,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39324 states and 129687 transitions. [2019-12-07 11:02:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:02:15,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:15,077 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] [2019-12-07 11:02:15,077 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-07 11:02:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848639847] [2019-12-07 11:02:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:15,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848639847] [2019-12-07 11:02:15,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:15,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:15,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606580090] [2019-12-07 11:02:15,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:15,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:15,119 INFO L87 Difference]: Start difference. First operand 39324 states and 129687 transitions. Second operand 5 states. [2019-12-07 11:02:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:15,433 INFO L93 Difference]: Finished difference Result 49344 states and 161427 transitions. [2019-12-07 11:02:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:02:15,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 11:02:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:15,516 INFO L225 Difference]: With dead ends: 49344 [2019-12-07 11:02:15,516 INFO L226 Difference]: Without dead ends: 49321 [2019-12-07 11:02:15,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:02:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49321 states. [2019-12-07 11:02:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49321 to 40993. [2019-12-07 11:02:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40993 states. [2019-12-07 11:02:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40993 states to 40993 states and 135255 transitions. [2019-12-07 11:02:16,335 INFO L78 Accepts]: Start accepts. Automaton has 40993 states and 135255 transitions. Word has length 28 [2019-12-07 11:02:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:16,335 INFO L462 AbstractCegarLoop]: Abstraction has 40993 states and 135255 transitions. [2019-12-07 11:02:16,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40993 states and 135255 transitions. [2019-12-07 11:02:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:02:16,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:16,352 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] [2019-12-07 11:02:16,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-07 11:02:16,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:16,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053243974] [2019-12-07 11:02:16,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:16,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053243974] [2019-12-07 11:02:16,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:16,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:16,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021662095] [2019-12-07 11:02:16,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:16,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:16,382 INFO L87 Difference]: Start difference. First operand 40993 states and 135255 transitions. Second operand 3 states. [2019-12-07 11:02:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:16,538 INFO L93 Difference]: Finished difference Result 51955 states and 170158 transitions. [2019-12-07 11:02:16,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:16,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 11:02:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:16,625 INFO L225 Difference]: With dead ends: 51955 [2019-12-07 11:02:16,625 INFO L226 Difference]: Without dead ends: 51955 [2019-12-07 11:02:16,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51955 states. [2019-12-07 11:02:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51955 to 42744. [2019-12-07 11:02:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42744 states. [2019-12-07 11:02:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42744 states to 42744 states and 138728 transitions. [2019-12-07 11:02:17,384 INFO L78 Accepts]: Start accepts. Automaton has 42744 states and 138728 transitions. Word has length 28 [2019-12-07 11:02:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:17,384 INFO L462 AbstractCegarLoop]: Abstraction has 42744 states and 138728 transitions. [2019-12-07 11:02:17,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 42744 states and 138728 transitions. [2019-12-07 11:02:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:02:17,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:17,403 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] [2019-12-07 11:02:17,403 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 602420915, now seen corresponding path program 1 times [2019-12-07 11:02:17,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:17,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783149319] [2019-12-07 11:02:17,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:17,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783149319] [2019-12-07 11:02:17,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:17,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:17,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234252960] [2019-12-07 11:02:17,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:17,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:17,431 INFO L87 Difference]: Start difference. First operand 42744 states and 138728 transitions. Second operand 3 states. [2019-12-07 11:02:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:17,540 INFO L93 Difference]: Finished difference Result 41058 states and 131884 transitions. [2019-12-07 11:02:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:17,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 11:02:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:17,598 INFO L225 Difference]: With dead ends: 41058 [2019-12-07 11:02:17,598 INFO L226 Difference]: Without dead ends: 41058 [2019-12-07 11:02:17,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41058 states. [2019-12-07 11:02:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41058 to 38731. [2019-12-07 11:02:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38731 states. [2019-12-07 11:02:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38731 states to 38731 states and 124582 transitions. [2019-12-07 11:02:18,234 INFO L78 Accepts]: Start accepts. Automaton has 38731 states and 124582 transitions. Word has length 28 [2019-12-07 11:02:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:18,234 INFO L462 AbstractCegarLoop]: Abstraction has 38731 states and 124582 transitions. [2019-12-07 11:02:18,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38731 states and 124582 transitions. [2019-12-07 11:02:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:02:18,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:18,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:18,252 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-07 11:02:18,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:18,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583005159] [2019-12-07 11:02:18,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:18,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583005159] [2019-12-07 11:02:18,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:18,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:18,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912064098] [2019-12-07 11:02:18,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:18,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:18,298 INFO L87 Difference]: Start difference. First operand 38731 states and 124582 transitions. Second operand 5 states. [2019-12-07 11:02:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:18,579 INFO L93 Difference]: Finished difference Result 48909 states and 156142 transitions. [2019-12-07 11:02:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:02:18,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 11:02:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:18,648 INFO L225 Difference]: With dead ends: 48909 [2019-12-07 11:02:18,648 INFO L226 Difference]: Without dead ends: 48885 [2019-12-07 11:02:18,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:02:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48885 states. [2019-12-07 11:02:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48885 to 38224. [2019-12-07 11:02:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38224 states. [2019-12-07 11:02:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38224 states to 38224 states and 122634 transitions. [2019-12-07 11:02:19,367 INFO L78 Accepts]: Start accepts. Automaton has 38224 states and 122634 transitions. Word has length 29 [2019-12-07 11:02:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:19,368 INFO L462 AbstractCegarLoop]: Abstraction has 38224 states and 122634 transitions. [2019-12-07 11:02:19,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38224 states and 122634 transitions. [2019-12-07 11:02:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:02:19,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:19,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:19,383 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -689746955, now seen corresponding path program 1 times [2019-12-07 11:02:19,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45831938] [2019-12-07 11:02:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:19,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45831938] [2019-12-07 11:02:19,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:19,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:19,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197196818] [2019-12-07 11:02:19,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:19,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:19,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:19,442 INFO L87 Difference]: Start difference. First operand 38224 states and 122634 transitions. Second operand 3 states. [2019-12-07 11:02:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:19,734 INFO L93 Difference]: Finished difference Result 71045 states and 227475 transitions. [2019-12-07 11:02:19,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:19,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:02:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:19,820 INFO L225 Difference]: With dead ends: 71045 [2019-12-07 11:02:19,820 INFO L226 Difference]: Without dead ends: 64395 [2019-12-07 11:02:19,820 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 11:02:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64395 states. [2019-12-07 11:02:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64395 to 62850. [2019-12-07 11:02:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62850 states. [2019-12-07 11:02:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62850 states to 62850 states and 199099 transitions. [2019-12-07 11:02:20,856 INFO L78 Accepts]: Start accepts. Automaton has 62850 states and 199099 transitions. Word has length 29 [2019-12-07 11:02:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:20,857 INFO L462 AbstractCegarLoop]: Abstraction has 62850 states and 199099 transitions. [2019-12-07 11:02:20,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 62850 states and 199099 transitions. [2019-12-07 11:02:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:02:20,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:20,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:20,884 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2117110737, now seen corresponding path program 1 times [2019-12-07 11:02:20,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:20,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845078456] [2019-12-07 11:02:20,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:20,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845078456] [2019-12-07 11:02:20,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:20,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:02:20,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665081398] [2019-12-07 11:02:20,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:02:20,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:02:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:20,999 INFO L87 Difference]: Start difference. First operand 62850 states and 199099 transitions. Second operand 9 states. [2019-12-07 11:02:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:21,427 INFO L93 Difference]: Finished difference Result 78324 states and 249278 transitions. [2019-12-07 11:02:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:02:21,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 11:02:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:21,540 INFO L225 Difference]: With dead ends: 78324 [2019-12-07 11:02:21,540 INFO L226 Difference]: Without dead ends: 78324 [2019-12-07 11:02:21,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:02:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78324 states. [2019-12-07 11:02:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78324 to 61455. [2019-12-07 11:02:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61455 states. [2019-12-07 11:02:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61455 states to 61455 states and 194509 transitions. [2019-12-07 11:02:22,628 INFO L78 Accepts]: Start accepts. Automaton has 61455 states and 194509 transitions. Word has length 30 [2019-12-07 11:02:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:22,628 INFO L462 AbstractCegarLoop]: Abstraction has 61455 states and 194509 transitions. [2019-12-07 11:02:22,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:02:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 61455 states and 194509 transitions. [2019-12-07 11:02:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:02:22,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:22,657 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] [2019-12-07 11:02:22,657 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 253100472, now seen corresponding path program 1 times [2019-12-07 11:02:22,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:22,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110701656] [2019-12-07 11:02:22,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:22,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110701656] [2019-12-07 11:02:22,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:22,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:22,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428674941] [2019-12-07 11:02:22,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:22,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:22,710 INFO L87 Difference]: Start difference. First operand 61455 states and 194509 transitions. Second operand 5 states. [2019-12-07 11:02:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:22,998 INFO L93 Difference]: Finished difference Result 103357 states and 329591 transitions. [2019-12-07 11:02:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:22,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:02:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:23,069 INFO L225 Difference]: With dead ends: 103357 [2019-12-07 11:02:23,069 INFO L226 Difference]: Without dead ends: 50143 [2019-12-07 11:02:23,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50143 states. [2019-12-07 11:02:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50143 to 49278. [2019-12-07 11:02:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49278 states. [2019-12-07 11:02:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49278 states to 49278 states and 157726 transitions. [2019-12-07 11:02:23,955 INFO L78 Accepts]: Start accepts. Automaton has 49278 states and 157726 transitions. Word has length 31 [2019-12-07 11:02:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:23,955 INFO L462 AbstractCegarLoop]: Abstraction has 49278 states and 157726 transitions. [2019-12-07 11:02:23,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 49278 states and 157726 transitions. [2019-12-07 11:02:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:02:23,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:23,985 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] [2019-12-07 11:02:23,985 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-07 11:02:23,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:23,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626886750] [2019-12-07 11:02:23,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:24,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626886750] [2019-12-07 11:02:24,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:24,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:24,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730292876] [2019-12-07 11:02:24,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:24,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:24,026 INFO L87 Difference]: Start difference. First operand 49278 states and 157726 transitions. Second operand 5 states. [2019-12-07 11:02:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:24,107 INFO L93 Difference]: Finished difference Result 21512 states and 65722 transitions. [2019-12-07 11:02:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:24,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:02:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:24,129 INFO L225 Difference]: With dead ends: 21512 [2019-12-07 11:02:24,129 INFO L226 Difference]: Without dead ends: 18671 [2019-12-07 11:02:24,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:02:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18671 states. [2019-12-07 11:02:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18671 to 18319. [2019-12-07 11:02:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-07 11:02:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 55746 transitions. [2019-12-07 11:02:24,380 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 55746 transitions. Word has length 31 [2019-12-07 11:02:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:24,381 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 55746 transitions. [2019-12-07 11:02:24,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 55746 transitions. [2019-12-07 11:02:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 11:02:24,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:24,396 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 11:02:24,396 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-07 11:02:24,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:24,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426460802] [2019-12-07 11:02:24,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:24,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426460802] [2019-12-07 11:02:24,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:24,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:24,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594555127] [2019-12-07 11:02:24,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:02:24,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:02:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:24,449 INFO L87 Difference]: Start difference. First operand 18319 states and 55746 transitions. Second operand 6 states. [2019-12-07 11:02:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:24,860 INFO L93 Difference]: Finished difference Result 22205 states and 65998 transitions. [2019-12-07 11:02:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:02:24,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 11:02:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:24,884 INFO L225 Difference]: With dead ends: 22205 [2019-12-07 11:02:24,884 INFO L226 Difference]: Without dead ends: 22018 [2019-12-07 11:02:24,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:02:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22018 states. [2019-12-07 11:02:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22018 to 18190. [2019-12-07 11:02:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18190 states. [2019-12-07 11:02:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18190 states to 18190 states and 55399 transitions. [2019-12-07 11:02:25,161 INFO L78 Accepts]: Start accepts. Automaton has 18190 states and 55399 transitions. Word has length 40 [2019-12-07 11:02:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:25,161 INFO L462 AbstractCegarLoop]: Abstraction has 18190 states and 55399 transitions. [2019-12-07 11:02:25,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:02:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18190 states and 55399 transitions. [2019-12-07 11:02:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:02:25,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:25,177 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 11:02:25,177 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-07 11:02:25,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:25,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859759939] [2019-12-07 11:02:25,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:25,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859759939] [2019-12-07 11:02:25,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:25,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:25,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137487233] [2019-12-07 11:02:25,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:02:25,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:02:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:25,219 INFO L87 Difference]: Start difference. First operand 18190 states and 55399 transitions. Second operand 6 states. [2019-12-07 11:02:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:25,582 INFO L93 Difference]: Finished difference Result 20918 states and 62519 transitions. [2019-12-07 11:02:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:02:25,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 11:02:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:25,603 INFO L225 Difference]: With dead ends: 20918 [2019-12-07 11:02:25,603 INFO L226 Difference]: Without dead ends: 20647 [2019-12-07 11:02:25,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:02:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20647 states. [2019-12-07 11:02:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20647 to 16806. [2019-12-07 11:02:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2019-12-07 11:02:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 51754 transitions. [2019-12-07 11:02:25,855 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 51754 transitions. Word has length 41 [2019-12-07 11:02:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:25,855 INFO L462 AbstractCegarLoop]: Abstraction has 16806 states and 51754 transitions. [2019-12-07 11:02:25,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:02:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 51754 transitions. [2019-12-07 11:02:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:02:25,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:25,870 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 11:02:25,870 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:25,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-07 11:02:25,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:25,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971130424] [2019-12-07 11:02:25,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:25,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971130424] [2019-12-07 11:02:25,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:25,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:25,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830137300] [2019-12-07 11:02:25,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:02:25,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:02:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:25,924 INFO L87 Difference]: Start difference. First operand 16806 states and 51754 transitions. Second operand 6 states. [2019-12-07 11:02:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:26,010 INFO L93 Difference]: Finished difference Result 15300 states and 48223 transitions. [2019-12-07 11:02:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:02:26,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 11:02:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:26,028 INFO L225 Difference]: With dead ends: 15300 [2019-12-07 11:02:26,028 INFO L226 Difference]: Without dead ends: 15004 [2019-12-07 11:02:26,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2019-12-07 11:02:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 10487. [2019-12-07 11:02:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10487 states. [2019-12-07 11:02:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10487 states to 10487 states and 32674 transitions. [2019-12-07 11:02:26,204 INFO L78 Accepts]: Start accepts. Automaton has 10487 states and 32674 transitions. Word has length 41 [2019-12-07 11:02:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:26,204 INFO L462 AbstractCegarLoop]: Abstraction has 10487 states and 32674 transitions. [2019-12-07 11:02:26,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:02:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 10487 states and 32674 transitions. [2019-12-07 11:02:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:02:26,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:26,214 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] [2019-12-07 11:02:26,214 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash -956860210, now seen corresponding path program 1 times [2019-12-07 11:02:26,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:26,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828986103] [2019-12-07 11:02:26,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:26,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828986103] [2019-12-07 11:02:26,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:26,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:26,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144990511] [2019-12-07 11:02:26,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:26,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:26,273 INFO L87 Difference]: Start difference. First operand 10487 states and 32674 transitions. Second operand 5 states. [2019-12-07 11:02:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:26,359 INFO L93 Difference]: Finished difference Result 27839 states and 88594 transitions. [2019-12-07 11:02:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:02:26,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 11:02:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:26,375 INFO L225 Difference]: With dead ends: 27839 [2019-12-07 11:02:26,376 INFO L226 Difference]: Without dead ends: 13125 [2019-12-07 11:02:26,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13125 states. [2019-12-07 11:02:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13125 to 8098. [2019-12-07 11:02:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8098 states. [2019-12-07 11:02:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8098 states to 8098 states and 25456 transitions. [2019-12-07 11:02:26,521 INFO L78 Accepts]: Start accepts. Automaton has 8098 states and 25456 transitions. Word has length 55 [2019-12-07 11:02:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:26,521 INFO L462 AbstractCegarLoop]: Abstraction has 8098 states and 25456 transitions. [2019-12-07 11:02:26,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8098 states and 25456 transitions. [2019-12-07 11:02:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:02:26,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:26,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:26,527 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1471935460, now seen corresponding path program 2 times [2019-12-07 11:02:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111235722] [2019-12-07 11:02:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:26,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111235722] [2019-12-07 11:02:26,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:26,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:26,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333396668] [2019-12-07 11:02:26,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:26,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:26,560 INFO L87 Difference]: Start difference. First operand 8098 states and 25456 transitions. Second operand 3 states. [2019-12-07 11:02:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:26,589 INFO L93 Difference]: Finished difference Result 7632 states and 23544 transitions. [2019-12-07 11:02:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:26,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 11:02:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:26,598 INFO L225 Difference]: With dead ends: 7632 [2019-12-07 11:02:26,598 INFO L226 Difference]: Without dead ends: 7632 [2019-12-07 11:02:26,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2019-12-07 11:02:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7352. [2019-12-07 11:02:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7352 states. [2019-12-07 11:02:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 22762 transitions. [2019-12-07 11:02:26,706 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 22762 transitions. Word has length 55 [2019-12-07 11:02:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:26,706 INFO L462 AbstractCegarLoop]: Abstraction has 7352 states and 22762 transitions. [2019-12-07 11:02:26,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 22762 transitions. [2019-12-07 11:02:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:02:26,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:26,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:26,713 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:26,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1782045904, now seen corresponding path program 1 times [2019-12-07 11:02:26,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:26,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31330603] [2019-12-07 11:02:26,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:26,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31330603] [2019-12-07 11:02:26,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:26,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:26,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496018468] [2019-12-07 11:02:26,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:26,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:26,777 INFO L87 Difference]: Start difference. First operand 7352 states and 22762 transitions. Second operand 4 states. [2019-12-07 11:02:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:26,812 INFO L93 Difference]: Finished difference Result 11994 states and 37458 transitions. [2019-12-07 11:02:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:26,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 11:02:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:26,818 INFO L225 Difference]: With dead ends: 11994 [2019-12-07 11:02:26,818 INFO L226 Difference]: Without dead ends: 4819 [2019-12-07 11:02:26,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-07 11:02:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-12-07 11:02:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-12-07 11:02:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 15164 transitions. [2019-12-07 11:02:26,888 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 15164 transitions. Word has length 56 [2019-12-07 11:02:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:26,888 INFO L462 AbstractCegarLoop]: Abstraction has 4819 states and 15164 transitions. [2019-12-07 11:02:26,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 15164 transitions. [2019-12-07 11:02:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:02:26,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:26,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:26,891 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 2 times [2019-12-07 11:02:26,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:26,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73417198] [2019-12-07 11:02:26,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:27,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73417198] [2019-12-07 11:02:27,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:27,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:02:27,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932187642] [2019-12-07 11:02:27,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:02:27,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:02:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:02:27,196 INFO L87 Difference]: Start difference. First operand 4819 states and 15164 transitions. Second operand 14 states. [2019-12-07 11:02:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:28,300 INFO L93 Difference]: Finished difference Result 9819 states and 30483 transitions. [2019-12-07 11:02:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:02:28,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 11:02:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:28,310 INFO L225 Difference]: With dead ends: 9819 [2019-12-07 11:02:28,310 INFO L226 Difference]: Without dead ends: 8805 [2019-12-07 11:02:28,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:02:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2019-12-07 11:02:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 6201. [2019-12-07 11:02:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2019-12-07 11:02:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 19400 transitions. [2019-12-07 11:02:28,441 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 19400 transitions. Word has length 56 [2019-12-07 11:02:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:28,441 INFO L462 AbstractCegarLoop]: Abstraction has 6201 states and 19400 transitions. [2019-12-07 11:02:28,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:02:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 19400 transitions. [2019-12-07 11:02:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:02:28,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:28,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:28,448 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1956752592, now seen corresponding path program 3 times [2019-12-07 11:02:28,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:28,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824269324] [2019-12-07 11:02:28,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:28,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824269324] [2019-12-07 11:02:28,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:28,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:02:28,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103670400] [2019-12-07 11:02:28,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:02:28,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:28,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:02:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:02:28,588 INFO L87 Difference]: Start difference. First operand 6201 states and 19400 transitions. Second operand 11 states. [2019-12-07 11:02:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:29,073 INFO L93 Difference]: Finished difference Result 11452 states and 35249 transitions. [2019-12-07 11:02:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:02:29,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 11:02:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:29,080 INFO L225 Difference]: With dead ends: 11452 [2019-12-07 11:02:29,080 INFO L226 Difference]: Without dead ends: 7064 [2019-12-07 11:02:29,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:02:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7064 states. [2019-12-07 11:02:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7064 to 5982. [2019-12-07 11:02:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5982 states. [2019-12-07 11:02:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5982 states to 5982 states and 18240 transitions. [2019-12-07 11:02:29,168 INFO L78 Accepts]: Start accepts. Automaton has 5982 states and 18240 transitions. Word has length 56 [2019-12-07 11:02:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 5982 states and 18240 transitions. [2019-12-07 11:02:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:02:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5982 states and 18240 transitions. [2019-12-07 11:02:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:02:29,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:29,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:29,173 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash -399702246, now seen corresponding path program 4 times [2019-12-07 11:02:29,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:29,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609475146] [2019-12-07 11:02:29,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:29,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609475146] [2019-12-07 11:02:29,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:29,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:02:29,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593132903] [2019-12-07 11:02:29,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:02:29,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:02:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:02:29,292 INFO L87 Difference]: Start difference. First operand 5982 states and 18240 transitions. Second operand 12 states. [2019-12-07 11:02:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:29,696 INFO L93 Difference]: Finished difference Result 7014 states and 20848 transitions. [2019-12-07 11:02:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:02:29,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 11:02:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:29,703 INFO L225 Difference]: With dead ends: 7014 [2019-12-07 11:02:29,703 INFO L226 Difference]: Without dead ends: 6568 [2019-12-07 11:02:29,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:02:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6568 states. [2019-12-07 11:02:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6568 to 5910. [2019-12-07 11:02:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5910 states. [2019-12-07 11:02:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 18009 transitions. [2019-12-07 11:02:29,789 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 18009 transitions. Word has length 56 [2019-12-07 11:02:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:29,790 INFO L462 AbstractCegarLoop]: Abstraction has 5910 states and 18009 transitions. [2019-12-07 11:02:29,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:02:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 18009 transitions. [2019-12-07 11:02:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:02:29,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:29,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:29,794 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 5 times [2019-12-07 11:02:29,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:29,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700810248] [2019-12-07 11:02:29,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:02:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:02:29,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:02:29,852 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:02:29,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26|) |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0))) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= (store .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26| 1) |v_#valid_62|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1909~0.base_26|) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ULTIMATE.start_main_~#t1909~0.offset=|v_ULTIMATE.start_main_~#t1909~0.offset_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_27|, ~y~0=v_~y~0_300, ULTIMATE.start_main_~#t1909~0.base=|v_ULTIMATE.start_main_~#t1909~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1911~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1910~0.base, ~y~0, ULTIMATE.start_main_~#t1909~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1909~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1910~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:02:29,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1910~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1910~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10|) |v_ULTIMATE.start_main_~#t1910~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1910~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1910~0.base] because there is no mapped edge [2019-12-07 11:02:29,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:02:29,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11|) |v_ULTIMATE.start_main_~#t1911~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1911~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1911~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1911~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_11|, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_~#t1911~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:02:29,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In99865692 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In99865692 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out99865692| ~x$w_buff1~0_In99865692) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In99865692 |P2Thread1of1ForFork1_#t~ite32_Out99865692|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out99865692|, ~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:02:29,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1815968230 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1815968230 256) 0))) (or (and (= ~x$w_buff0_used~0_In1815968230 |P2Thread1of1ForFork1_#t~ite34_Out1815968230|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1815968230|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1815968230|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:02:29,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-599208867 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-599208867| |P0Thread1of1ForFork2_#t~ite8_Out-599208867|) (= |P0Thread1of1ForFork2_#t~ite8_Out-599208867| ~x$w_buff0~0_In-599208867) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-599208867 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-599208867 256)) (and (= (mod ~x$r_buff1_thd1~0_In-599208867 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-599208867 256)) .cse0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-599208867| ~x$w_buff0~0_In-599208867) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite8_In-599208867| |P0Thread1of1ForFork2_#t~ite8_Out-599208867|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-599208867, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-599208867, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-599208867|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-599208867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-599208867, ~weak$$choice2~0=~weak$$choice2~0_In-599208867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-599208867} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-599208867, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-599208867, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-599208867|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-599208867, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-599208867|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-599208867, ~weak$$choice2~0=~weak$$choice2~0_In-599208867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-599208867} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 11:02:29,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-702445644 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-702445644 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-702445644 |P1Thread1of1ForFork0_#t~ite28_Out-702445644|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-702445644|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-702445644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702445644} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-702445644, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-702445644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702445644} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:02:29,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1246656071 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1246656071 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1246656071 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1246656071 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1246656071 |P1Thread1of1ForFork0_#t~ite29_Out-1246656071|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1246656071|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1246656071, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1246656071, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1246656071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246656071} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1246656071, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1246656071, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1246656071, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1246656071|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246656071} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:02:29,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In604246967 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In604246967 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_Out604246967 ~x$r_buff0_thd2~0_In604246967))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out604246967 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out604246967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:02:29,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1294754579 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1294754579 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1294754579 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1294754579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1294754579 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1294754579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:02:29,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:02:29,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In751782227 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In751782227 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In751782227 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In751782227 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out751782227|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In751782227 |P2Thread1of1ForFork1_#t~ite35_Out751782227|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In751782227, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In751782227, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751782227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751782227} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out751782227|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In751782227, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In751782227, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751782227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751782227} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:02:29,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2076705743 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2076705743 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-2076705743 |P2Thread1of1ForFork1_#t~ite36_Out-2076705743|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2076705743|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2076705743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2076705743} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2076705743|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2076705743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2076705743} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:02:29,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-513368619 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-513368619 256)))) (or (= (mod ~x$w_buff0_used~0_In-513368619 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-513368619 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-513368619 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite18_Out-513368619| |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) (= ~x$w_buff1_used~0_In-513368619 |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_In-513368619| |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) (= |P0Thread1of1ForFork2_#t~ite18_Out-513368619| ~x$w_buff1_used~0_In-513368619)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-513368619, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-513368619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513368619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-513368619, ~weak$$choice2~0=~weak$$choice2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-513368619, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-513368619|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-513368619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513368619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-513368619, ~weak$$choice2~0=~weak$$choice2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 11:02:29,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:02:29,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1636480310 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In1636480310| |P0Thread1of1ForFork2_#t~ite23_Out1636480310|) (= |P0Thread1of1ForFork2_#t~ite24_Out1636480310| ~x$r_buff1_thd1~0_In1636480310)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out1636480310| ~x$r_buff1_thd1~0_In1636480310) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1636480310| |P0Thread1of1ForFork2_#t~ite24_Out1636480310|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1636480310 256)))) (or (= (mod ~x$w_buff0_used~0_In1636480310 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1636480310 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1636480310 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636480310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636480310, ~weak$$choice2~0=~weak$$choice2~0_In1636480310, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1636480310|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636480310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636480310, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1636480310|, ~weak$$choice2~0=~weak$$choice2~0_In1636480310, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1636480310|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-734814481 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-734814481 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-734814481 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-734814481 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-734814481| ~x$r_buff1_thd3~0_In-734814481)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-734814481|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-734814481, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-734814481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-734814481} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-734814481|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-734814481, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-734814481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-734814481} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1065375475 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1065375475 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1065375475| ~x~0_In1065375475) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In1065375475 |ULTIMATE.start_main_#t~ite41_Out1065375475|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x~0=~x~0_In1065375475} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1065375475|, ~x$w_buff1~0=~x$w_buff1~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x~0=~x~0_In1065375475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-957727977 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-957727977 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-957727977| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-957727977| ~x$w_buff0_used~0_In-957727977)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-957727977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957727977} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-957727977, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-957727977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957727977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:02:29,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In193922059 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In193922059 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In193922059 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In193922059 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out193922059| ~x$w_buff1_used~0_In193922059) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out193922059| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In193922059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193922059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In193922059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193922059} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In193922059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193922059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In193922059, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out193922059|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193922059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:02:29,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1393987879 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1393987879 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1393987879|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1393987879| ~x$r_buff0_thd0~0_In1393987879) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1393987879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393987879} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1393987879, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1393987879|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393987879} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:02:29,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In57305645 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In57305645 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In57305645 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In57305645 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In57305645 |ULTIMATE.start_main_#t~ite46_Out57305645|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out57305645| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In57305645, ~x$w_buff1_used~0=~x$w_buff1_used~0_In57305645, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In57305645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In57305645} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In57305645, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out57305645|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In57305645, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In57305645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In57305645} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:02:29,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:02:29,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:02:29 BasicIcfg [2019-12-07 11:02:29,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:02:29,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:02:29,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:02:29,912 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:02:29,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:01:40" (3/4) ... [2019-12-07 11:02:29,915 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:02:29,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26|) |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0))) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= (store .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26| 1) |v_#valid_62|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1909~0.base_26|) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ULTIMATE.start_main_~#t1909~0.offset=|v_ULTIMATE.start_main_~#t1909~0.offset_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_27|, ~y~0=v_~y~0_300, ULTIMATE.start_main_~#t1909~0.base=|v_ULTIMATE.start_main_~#t1909~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1911~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1910~0.base, ~y~0, ULTIMATE.start_main_~#t1909~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1909~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1910~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:02:29,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1910~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1910~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10|) |v_ULTIMATE.start_main_~#t1910~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1910~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1910~0.base] because there is no mapped edge [2019-12-07 11:02:29,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:02:29,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11|) |v_ULTIMATE.start_main_~#t1911~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1911~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1911~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1911~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_11|, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_~#t1911~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:02:29,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In99865692 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In99865692 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out99865692| ~x$w_buff1~0_In99865692) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In99865692 |P2Thread1of1ForFork1_#t~ite32_Out99865692|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out99865692|, ~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:02:29,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1815968230 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1815968230 256) 0))) (or (and (= ~x$w_buff0_used~0_In1815968230 |P2Thread1of1ForFork1_#t~ite34_Out1815968230|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1815968230|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1815968230|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:02:29,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-599208867 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-599208867| |P0Thread1of1ForFork2_#t~ite8_Out-599208867|) (= |P0Thread1of1ForFork2_#t~ite8_Out-599208867| ~x$w_buff0~0_In-599208867) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-599208867 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-599208867 256)) (and (= (mod ~x$r_buff1_thd1~0_In-599208867 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-599208867 256)) .cse0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-599208867| ~x$w_buff0~0_In-599208867) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite8_In-599208867| |P0Thread1of1ForFork2_#t~ite8_Out-599208867|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-599208867, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-599208867, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-599208867|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-599208867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-599208867, ~weak$$choice2~0=~weak$$choice2~0_In-599208867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-599208867} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-599208867, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-599208867, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-599208867|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-599208867, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-599208867|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-599208867, ~weak$$choice2~0=~weak$$choice2~0_In-599208867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-599208867} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 11:02:29,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-702445644 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-702445644 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-702445644 |P1Thread1of1ForFork0_#t~ite28_Out-702445644|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-702445644|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-702445644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702445644} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-702445644, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-702445644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702445644} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:02:29,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1246656071 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1246656071 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1246656071 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1246656071 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1246656071 |P1Thread1of1ForFork0_#t~ite29_Out-1246656071|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1246656071|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1246656071, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1246656071, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1246656071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246656071} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1246656071, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1246656071, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1246656071, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1246656071|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246656071} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:02:29,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In604246967 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In604246967 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_Out604246967 ~x$r_buff0_thd2~0_In604246967))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out604246967 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out604246967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:02:29,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1294754579 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1294754579 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1294754579 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1294754579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1294754579 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1294754579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:02:29,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:02:29,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In751782227 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In751782227 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In751782227 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In751782227 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out751782227|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In751782227 |P2Thread1of1ForFork1_#t~ite35_Out751782227|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In751782227, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In751782227, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751782227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751782227} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out751782227|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In751782227, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In751782227, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In751782227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751782227} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:02:29,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2076705743 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2076705743 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-2076705743 |P2Thread1of1ForFork1_#t~ite36_Out-2076705743|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2076705743|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2076705743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2076705743} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2076705743|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2076705743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2076705743} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:02:29,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-513368619 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-513368619 256)))) (or (= (mod ~x$w_buff0_used~0_In-513368619 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-513368619 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-513368619 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite18_Out-513368619| |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) (= ~x$w_buff1_used~0_In-513368619 |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_In-513368619| |P0Thread1of1ForFork2_#t~ite17_Out-513368619|) (= |P0Thread1of1ForFork2_#t~ite18_Out-513368619| ~x$w_buff1_used~0_In-513368619)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-513368619, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-513368619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513368619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-513368619, ~weak$$choice2~0=~weak$$choice2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-513368619, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-513368619|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-513368619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513368619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-513368619, ~weak$$choice2~0=~weak$$choice2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 11:02:29,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:02:29,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1636480310 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In1636480310| |P0Thread1of1ForFork2_#t~ite23_Out1636480310|) (= |P0Thread1of1ForFork2_#t~ite24_Out1636480310| ~x$r_buff1_thd1~0_In1636480310)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out1636480310| ~x$r_buff1_thd1~0_In1636480310) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1636480310| |P0Thread1of1ForFork2_#t~ite24_Out1636480310|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1636480310 256)))) (or (= (mod ~x$w_buff0_used~0_In1636480310 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1636480310 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1636480310 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636480310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636480310, ~weak$$choice2~0=~weak$$choice2~0_In1636480310, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1636480310|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636480310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636480310, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1636480310|, ~weak$$choice2~0=~weak$$choice2~0_In1636480310, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1636480310|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-734814481 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-734814481 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-734814481 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-734814481 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-734814481| ~x$r_buff1_thd3~0_In-734814481)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-734814481|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-734814481, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-734814481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-734814481} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-734814481|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-734814481, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-734814481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-734814481} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1065375475 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1065375475 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1065375475| ~x~0_In1065375475) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In1065375475 |ULTIMATE.start_main_#t~ite41_Out1065375475|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x~0=~x~0_In1065375475} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1065375475|, ~x$w_buff1~0=~x$w_buff1~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x~0=~x~0_In1065375475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:02:29,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 11:02:29,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-957727977 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-957727977 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-957727977| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-957727977| ~x$w_buff0_used~0_In-957727977)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-957727977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957727977} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-957727977, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-957727977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957727977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:02:29,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In193922059 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In193922059 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In193922059 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In193922059 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out193922059| ~x$w_buff1_used~0_In193922059) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out193922059| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In193922059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193922059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In193922059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193922059} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In193922059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In193922059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In193922059, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out193922059|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In193922059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:02:29,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1393987879 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1393987879 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1393987879|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1393987879| ~x$r_buff0_thd0~0_In1393987879) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1393987879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393987879} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1393987879, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1393987879|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393987879} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:02:29,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In57305645 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In57305645 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In57305645 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In57305645 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In57305645 |ULTIMATE.start_main_#t~ite46_Out57305645|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out57305645| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In57305645, ~x$w_buff1_used~0=~x$w_buff1_used~0_In57305645, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In57305645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In57305645} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In57305645, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out57305645|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In57305645, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In57305645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In57305645} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:02:29,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:02:29,972 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c25fac37-dde0-4df4-b1e7-1dab63b2b701/bin/uautomizer/witness.graphml [2019-12-07 11:02:29,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:02:29,973 INFO L168 Benchmark]: Toolchain (without parser) took 50700.14 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 939.9 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,973 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:02:29,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,974 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:02:29,974 INFO L168 Benchmark]: RCFGBuilder took 381.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,975 INFO L168 Benchmark]: TraceAbstraction took 49791.84 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,975 INFO L168 Benchmark]: Witness Printer took 60.06 ms. Allocated memory is still 5.3 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:29,976 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 381.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49791.84 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 60.06 ms. Allocated memory is still 5.3 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1911, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.6s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4095 SDtfs, 6161 SDslu, 10685 SDs, 0 SdLazy, 5021 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 135803 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 197464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...