./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/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 9ee5fb25ddbc1b3a616c86d1f772edb2fe0af500 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:27:21,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:27:21,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:27:21,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:27:21,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:27:21,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:27:21,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:27:21,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:27:21,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:27:21,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:27:21,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:27:21,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:27:21,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:27:21,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:27:21,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:27:21,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:27:21,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:27:21,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:27:21,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:27:21,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:27:21,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:27:21,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:27:21,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:27:21,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:27:21,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:27:21,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:27:21,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:27:21,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:27:21,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:27:21,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:27:21,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:27:21,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:27:21,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:27:21,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:27:21,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:27:21,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:27:21,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:27:21,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:27:21,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:27:21,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:27:21,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:27:21,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:27:21,736 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:27:21,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:27:21,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:27:21,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:27:21,737 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:27:21,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:27:21,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:27:21,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:27:21,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:27:21,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:27:21,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:27:21,740 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_570b2012-89d5-40d4-802f-89dce1534fbf/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 -> 9ee5fb25ddbc1b3a616c86d1f772edb2fe0af500 [2019-12-07 14:27:21,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:27:21,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:27:21,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:27:21,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:27:21,855 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:27:21,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i [2019-12-07 14:27:21,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/data/11d502d5c/f034435d90b5419c8d1e864a1fd1cda2/FLAG7f32a5aef [2019-12-07 14:27:22,341 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:27:22,341 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/sv-benchmarks/c/pthread-wmm/safe024_rmo.opt.i [2019-12-07 14:27:22,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/data/11d502d5c/f034435d90b5419c8d1e864a1fd1cda2/FLAG7f32a5aef [2019-12-07 14:27:22,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/data/11d502d5c/f034435d90b5419c8d1e864a1fd1cda2 [2019-12-07 14:27:22,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:27:22,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:27:22,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:27:22,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:27:22,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:27:22,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22, skipping insertion in model container [2019-12-07 14:27:22,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:27:22,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:27:22,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:27:22,656 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:27:22,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:27:22,737 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:27:22,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22 WrapperNode [2019-12-07 14:27:22,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:27:22,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:27:22,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:27:22,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:27:22,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:27:22,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:27:22,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:27:22,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:27:22,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... [2019-12-07 14:27:22,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:27:22,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:27:22,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:27:22,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:27:22,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/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 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:27:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:27:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:27:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:27:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:27:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:27:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:27:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:27:22,840 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 14:27:23,185 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:27:23,185 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:27:23,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:27:23 BoogieIcfgContainer [2019-12-07 14:27:23,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:27:23,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:27:23,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:27:23,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:27:23,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:27:22" (1/3) ... [2019-12-07 14:27:23,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d176be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:27:23, skipping insertion in model container [2019-12-07 14:27:23,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:27:22" (2/3) ... [2019-12-07 14:27:23,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d176be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:27:23, skipping insertion in model container [2019-12-07 14:27:23,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:27:23" (3/3) ... [2019-12-07 14:27:23,191 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.opt.i [2019-12-07 14:27:23,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:27:23,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:27:23,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:27:23,204 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:27:23,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:27:23,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:27:23,277 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:27:23,277 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:27:23,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:27:23,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:27:23,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:27:23,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:27:23,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:27:23,290 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 14:27:23,291 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:27:23,353 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:27:23,353 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:27:23,365 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:27:23,379 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:27:23,415 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:27:23,415 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:27:23,421 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:27:23,438 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 14:27:23,438 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:27:26,502 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 14:27:26,602 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 14:27:26,602 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 14:27:26,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 14:27:36,265 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 14:27:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 14:27:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:27:36,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:36,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:27:36,271 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 14:27:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 14:27:36,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:27:36,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282140039] [2019-12-07 14:27:36,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:36,423 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 14:27:36,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282140039] [2019-12-07 14:27:36,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:36,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:27:36,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199126578] [2019-12-07 14:27:36,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:27:36,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:27:36,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:27:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:27:36,438 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 14:27:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:37,006 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 14:27:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:27:37,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:27:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:37,525 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 14:27:37,525 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 14:27:37,526 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 14:27:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 14:27:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 14:27:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 14:27:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 14:27:42,255 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 14:27:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:42,256 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 14:27:42,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:27:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 14:27:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:27:42,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:42,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:42,267 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 14:27:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:42,267 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 14:27:42,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:27:42,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877573590] [2019-12-07 14:27:42,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:42,371 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 14:27:42,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877573590] [2019-12-07 14:27:42,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:42,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:27:42,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566206046] [2019-12-07 14:27:42,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:27:42,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:27:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:27:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:42,373 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 14:27:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:44,518 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 14:27:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:27:44,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:27:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:44,875 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 14:27:44,875 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 14:27:44,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:27:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 14:27:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 14:27:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 14:27:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 14:27:50,693 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 14:27:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:50,693 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 14:27:50,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:27:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 14:27:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:27:50,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:50,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:50,696 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 14:27:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 14:27:50,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:27:50,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544187084] [2019-12-07 14:27:50,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:50,756 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 14:27:50,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544187084] [2019-12-07 14:27:50,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:27:50,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:27:50,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93693005] [2019-12-07 14:27:50,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:27:50,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:27:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:27:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:27:50,758 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 4 states. [2019-12-07 14:27:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:51,929 INFO L93 Difference]: Finished difference Result 162018 states and 656174 transitions. [2019-12-07 14:27:51,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:27:51,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:27:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:52,325 INFO L225 Difference]: With dead ends: 162018 [2019-12-07 14:27:52,325 INFO L226 Difference]: Without dead ends: 161922 [2019-12-07 14:27:52,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:27:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161922 states. [2019-12-07 14:28:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161922 to 136790. [2019-12-07 14:28:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136790 states. [2019-12-07 14:28:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136790 states to 136790 states and 563231 transitions. [2019-12-07 14:28:00,774 INFO L78 Accepts]: Start accepts. Automaton has 136790 states and 563231 transitions. Word has length 13 [2019-12-07 14:28:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:00,774 INFO L462 AbstractCegarLoop]: Abstraction has 136790 states and 563231 transitions. [2019-12-07 14:28:00,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 136790 states and 563231 transitions. [2019-12-07 14:28:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:28:00,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:00,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:00,777 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 14:28:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 14:28:00,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689607634] [2019-12-07 14:28:00,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:00,825 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 14:28:00,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689607634] [2019-12-07 14:28:00,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:00,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:00,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439903481] [2019-12-07 14:28:00,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:00,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:00,826 INFO L87 Difference]: Start difference. First operand 136790 states and 563231 transitions. Second operand 5 states. [2019-12-07 14:28:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:01,747 INFO L93 Difference]: Finished difference Result 183350 states and 741495 transitions. [2019-12-07 14:28:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:28:01,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:28:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:02,204 INFO L225 Difference]: With dead ends: 183350 [2019-12-07 14:28:02,204 INFO L226 Difference]: Without dead ends: 183222 [2019-12-07 14:28:02,204 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 14:28:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183222 states. [2019-12-07 14:28:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183222 to 144665. [2019-12-07 14:28:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144665 states. [2019-12-07 14:28:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144665 states to 144665 states and 594615 transitions. [2019-12-07 14:28:11,352 INFO L78 Accepts]: Start accepts. Automaton has 144665 states and 594615 transitions. Word has length 14 [2019-12-07 14:28:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:11,352 INFO L462 AbstractCegarLoop]: Abstraction has 144665 states and 594615 transitions. [2019-12-07 14:28:11,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 144665 states and 594615 transitions. [2019-12-07 14:28:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:28:11,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:11,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:11,371 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 14:28:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash -272588530, now seen corresponding path program 1 times [2019-12-07 14:28:11,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:11,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819333914] [2019-12-07 14:28:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:11,418 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 14:28:11,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819333914] [2019-12-07 14:28:11,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:11,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:28:11,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857834041] [2019-12-07 14:28:11,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:11,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:11,419 INFO L87 Difference]: Start difference. First operand 144665 states and 594615 transitions. Second operand 3 states. [2019-12-07 14:28:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:12,045 INFO L93 Difference]: Finished difference Result 144674 states and 593554 transitions. [2019-12-07 14:28:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:12,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:28:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:12,415 INFO L225 Difference]: With dead ends: 144674 [2019-12-07 14:28:12,415 INFO L226 Difference]: Without dead ends: 144674 [2019-12-07 14:28:12,415 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 14:28:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144674 states. [2019-12-07 14:28:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144674 to 143982. [2019-12-07 14:28:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143982 states. [2019-12-07 14:28:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143982 states to 143982 states and 591770 transitions. [2019-12-07 14:28:19,386 INFO L78 Accepts]: Start accepts. Automaton has 143982 states and 591770 transitions. Word has length 18 [2019-12-07 14:28:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:19,386 INFO L462 AbstractCegarLoop]: Abstraction has 143982 states and 591770 transitions. [2019-12-07 14:28:19,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 143982 states and 591770 transitions. [2019-12-07 14:28:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:28:19,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:19,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] [2019-12-07 14:28:19,404 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 14:28:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1563609712, now seen corresponding path program 1 times [2019-12-07 14:28:19,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:19,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608572759] [2019-12-07 14:28:19,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:19,457 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 14:28:19,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608572759] [2019-12-07 14:28:19,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:19,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:19,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094146440] [2019-12-07 14:28:19,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:19,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:19,458 INFO L87 Difference]: Start difference. First operand 143982 states and 591770 transitions. Second operand 4 states. [2019-12-07 14:28:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:20,400 INFO L93 Difference]: Finished difference Result 231990 states and 956377 transitions. [2019-12-07 14:28:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:28:20,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:28:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:20,993 INFO L225 Difference]: With dead ends: 231990 [2019-12-07 14:28:20,993 INFO L226 Difference]: Without dead ends: 221422 [2019-12-07 14:28:20,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:28:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221422 states. [2019-12-07 14:28:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221422 to 220426. [2019-12-07 14:28:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220426 states. [2019-12-07 14:28:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220426 states to 220426 states and 910445 transitions. [2019-12-07 14:28:32,152 INFO L78 Accepts]: Start accepts. Automaton has 220426 states and 910445 transitions. Word has length 19 [2019-12-07 14:28:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:32,153 INFO L462 AbstractCegarLoop]: Abstraction has 220426 states and 910445 transitions. [2019-12-07 14:28:32,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220426 states and 910445 transitions. [2019-12-07 14:28:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:28:32,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:32,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:32,181 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 14:28:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash -406957021, now seen corresponding path program 1 times [2019-12-07 14:28:32,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:32,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110977936] [2019-12-07 14:28:32,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:32,229 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 14:28:32,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110977936] [2019-12-07 14:28:32,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:32,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:32,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268318114] [2019-12-07 14:28:32,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:32,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:32,230 INFO L87 Difference]: Start difference. First operand 220426 states and 910445 transitions. Second operand 5 states. [2019-12-07 14:28:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:34,159 INFO L93 Difference]: Finished difference Result 294810 states and 1193044 transitions. [2019-12-07 14:28:34,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:28:34,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:28:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:34,926 INFO L225 Difference]: With dead ends: 294810 [2019-12-07 14:28:34,926 INFO L226 Difference]: Without dead ends: 294360 [2019-12-07 14:28:34,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:28:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294360 states. [2019-12-07 14:28:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294360 to 230207. [2019-12-07 14:28:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230207 states. [2019-12-07 14:28:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230207 states to 230207 states and 949249 transitions. [2019-12-07 14:28:45,969 INFO L78 Accepts]: Start accepts. Automaton has 230207 states and 949249 transitions. Word has length 19 [2019-12-07 14:28:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:45,970 INFO L462 AbstractCegarLoop]: Abstraction has 230207 states and 949249 transitions. [2019-12-07 14:28:45,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 230207 states and 949249 transitions. [2019-12-07 14:28:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:28:46,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:46,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:46,005 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 14:28:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1179777139, now seen corresponding path program 1 times [2019-12-07 14:28:46,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:46,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141206702] [2019-12-07 14:28:46,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:46,028 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 14:28:46,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141206702] [2019-12-07 14:28:46,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:46,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:46,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654427549] [2019-12-07 14:28:46,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:46,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:46,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:46,029 INFO L87 Difference]: Start difference. First operand 230207 states and 949249 transitions. Second operand 3 states. [2019-12-07 14:28:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:46,172 INFO L93 Difference]: Finished difference Result 47747 states and 158647 transitions. [2019-12-07 14:28:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:46,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:28:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:46,247 INFO L225 Difference]: With dead ends: 47747 [2019-12-07 14:28:46,247 INFO L226 Difference]: Without dead ends: 47747 [2019-12-07 14:28:46,247 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 14:28:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-07 14:28:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 47747. [2019-12-07 14:28:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47747 states. [2019-12-07 14:28:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47747 states to 47747 states and 158647 transitions. [2019-12-07 14:28:47,001 INFO L78 Accepts]: Start accepts. Automaton has 47747 states and 158647 transitions. Word has length 20 [2019-12-07 14:28:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:47,001 INFO L462 AbstractCegarLoop]: Abstraction has 47747 states and 158647 transitions. [2019-12-07 14:28:47,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 47747 states and 158647 transitions. [2019-12-07 14:28:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:28:47,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:47,009 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 14:28:47,009 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 14:28:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 14:28:47,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:47,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786248827] [2019-12-07 14:28:47,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:47,064 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 14:28:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786248827] [2019-12-07 14:28:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:47,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:28:47,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601095466] [2019-12-07 14:28:47,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:28:47,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:28:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:28:47,065 INFO L87 Difference]: Start difference. First operand 47747 states and 158647 transitions. Second operand 6 states. [2019-12-07 14:28:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:47,689 INFO L93 Difference]: Finished difference Result 69100 states and 224920 transitions. [2019-12-07 14:28:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:28:47,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:28:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:47,796 INFO L225 Difference]: With dead ends: 69100 [2019-12-07 14:28:47,796 INFO L226 Difference]: Without dead ends: 68988 [2019-12-07 14:28:47,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:28:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68988 states. [2019-12-07 14:28:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68988 to 50689. [2019-12-07 14:28:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50689 states. [2019-12-07 14:28:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50689 states to 50689 states and 167058 transitions. [2019-12-07 14:28:49,135 INFO L78 Accepts]: Start accepts. Automaton has 50689 states and 167058 transitions. Word has length 22 [2019-12-07 14:28:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:49,135 INFO L462 AbstractCegarLoop]: Abstraction has 50689 states and 167058 transitions. [2019-12-07 14:28:49,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:28:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 50689 states and 167058 transitions. [2019-12-07 14:28:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:28:49,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:49,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:49,154 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 14:28:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 14:28:49,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:49,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592171690] [2019-12-07 14:28:49,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:28:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592171690] [2019-12-07 14:28:49,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:49,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:49,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74929282] [2019-12-07 14:28:49,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:49,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:49,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:49,191 INFO L87 Difference]: Start difference. First operand 50689 states and 167058 transitions. Second operand 4 states. [2019-12-07 14:28:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:49,255 INFO L93 Difference]: Finished difference Result 19230 states and 59112 transitions. [2019-12-07 14:28:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:28:49,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:28:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:49,279 INFO L225 Difference]: With dead ends: 19230 [2019-12-07 14:28:49,279 INFO L226 Difference]: Without dead ends: 19230 [2019-12-07 14:28:49,279 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 14:28:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19230 states. [2019-12-07 14:28:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19230 to 18935. [2019-12-07 14:28:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18935 states. [2019-12-07 14:28:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18935 states to 18935 states and 58222 transitions. [2019-12-07 14:28:49,541 INFO L78 Accepts]: Start accepts. Automaton has 18935 states and 58222 transitions. Word has length 27 [2019-12-07 14:28:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:49,541 INFO L462 AbstractCegarLoop]: Abstraction has 18935 states and 58222 transitions. [2019-12-07 14:28:49,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 18935 states and 58222 transitions. [2019-12-07 14:28:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:28:49,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:49,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:49,558 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 14:28:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 14:28:49,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:49,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935576549] [2019-12-07 14:28:49,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:49,600 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 14:28:49,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935576549] [2019-12-07 14:28:49,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:49,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:28:49,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503841740] [2019-12-07 14:28:49,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:49,602 INFO L87 Difference]: Start difference. First operand 18935 states and 58222 transitions. Second operand 5 states. [2019-12-07 14:28:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:49,660 INFO L93 Difference]: Finished difference Result 17059 states and 53554 transitions. [2019-12-07 14:28:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:28:49,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:28:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:49,681 INFO L225 Difference]: With dead ends: 17059 [2019-12-07 14:28:49,681 INFO L226 Difference]: Without dead ends: 17011 [2019-12-07 14:28:49,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17011 states. [2019-12-07 14:28:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17011 to 10977. [2019-12-07 14:28:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-07 14:28:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34160 transitions. [2019-12-07 14:28:49,883 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34160 transitions. Word has length 39 [2019-12-07 14:28:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:49,884 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34160 transitions. [2019-12-07 14:28:49,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34160 transitions. [2019-12-07 14:28:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:28:49,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:49,894 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] [2019-12-07 14:28:49,895 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 14:28:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-07 14:28:49,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:49,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641111197] [2019-12-07 14:28:49,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:49,951 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 14:28:49,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641111197] [2019-12-07 14:28:49,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:49,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:28:49,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241797932] [2019-12-07 14:28:49,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:49,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:49,952 INFO L87 Difference]: Start difference. First operand 10977 states and 34160 transitions. Second operand 5 states. [2019-12-07 14:28:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:50,230 INFO L93 Difference]: Finished difference Result 15852 states and 48716 transitions. [2019-12-07 14:28:50,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:28:50,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 14:28:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:50,248 INFO L225 Difference]: With dead ends: 15852 [2019-12-07 14:28:50,248 INFO L226 Difference]: Without dead ends: 15852 [2019-12-07 14:28:50,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:28:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-07 14:28:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 14457. [2019-12-07 14:28:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-12-07 14:28:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 44688 transitions. [2019-12-07 14:28:50,466 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 44688 transitions. Word has length 53 [2019-12-07 14:28:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:50,466 INFO L462 AbstractCegarLoop]: Abstraction has 14457 states and 44688 transitions. [2019-12-07 14:28:50,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 44688 transitions. [2019-12-07 14:28:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:28:50,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:50,480 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] [2019-12-07 14:28:50,480 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 14:28:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash 194850767, now seen corresponding path program 2 times [2019-12-07 14:28:50,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:50,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453239357] [2019-12-07 14:28:50,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:28:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453239357] [2019-12-07 14:28:50,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:50,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:28:50,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104846550] [2019-12-07 14:28:50,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:28:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:28:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:28:50,555 INFO L87 Difference]: Start difference. First operand 14457 states and 44688 transitions. Second operand 6 states. [2019-12-07 14:28:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:51,022 INFO L93 Difference]: Finished difference Result 25137 states and 77672 transitions. [2019-12-07 14:28:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:28:51,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 14:28:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:51,052 INFO L225 Difference]: With dead ends: 25137 [2019-12-07 14:28:51,052 INFO L226 Difference]: Without dead ends: 25137 [2019-12-07 14:28:51,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:28:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-07 14:28:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16137. [2019-12-07 14:28:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-07 14:28:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 49935 transitions. [2019-12-07 14:28:51,349 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 49935 transitions. Word has length 53 [2019-12-07 14:28:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:51,349 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 49935 transitions. [2019-12-07 14:28:51,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:28:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 49935 transitions. [2019-12-07 14:28:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:28:51,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:51,364 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] [2019-12-07 14:28:51,364 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 14:28:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash 690646521, now seen corresponding path program 3 times [2019-12-07 14:28:51,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:51,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115598525] [2019-12-07 14:28:51,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:51,441 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 14:28:51,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115598525] [2019-12-07 14:28:51,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:51,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:28:51,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587456772] [2019-12-07 14:28:51,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:28:51,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:28:51,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:28:51,443 INFO L87 Difference]: Start difference. First operand 16137 states and 49935 transitions. Second operand 7 states. [2019-12-07 14:28:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:52,691 INFO L93 Difference]: Finished difference Result 21134 states and 64354 transitions. [2019-12-07 14:28:52,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:28:52,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 14:28:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:52,714 INFO L225 Difference]: With dead ends: 21134 [2019-12-07 14:28:52,714 INFO L226 Difference]: Without dead ends: 21134 [2019-12-07 14:28:52,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:28:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2019-12-07 14:28:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 16476. [2019-12-07 14:28:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16476 states. [2019-12-07 14:28:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16476 states to 16476 states and 50971 transitions. [2019-12-07 14:28:52,980 INFO L78 Accepts]: Start accepts. Automaton has 16476 states and 50971 transitions. Word has length 53 [2019-12-07 14:28:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:52,981 INFO L462 AbstractCegarLoop]: Abstraction has 16476 states and 50971 transitions. [2019-12-07 14:28:52,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:28:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 16476 states and 50971 transitions. [2019-12-07 14:28:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:28:52,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:52,995 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] [2019-12-07 14:28:52,995 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 14:28:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash 798365505, now seen corresponding path program 4 times [2019-12-07 14:28:52,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:52,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393957713] [2019-12-07 14:28:52,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:53,063 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 14:28:53,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393957713] [2019-12-07 14:28:53,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:53,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:28:53,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260966303] [2019-12-07 14:28:53,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:28:53,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:28:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:28:53,065 INFO L87 Difference]: Start difference. First operand 16476 states and 50971 transitions. Second operand 7 states. [2019-12-07 14:28:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:53,646 INFO L93 Difference]: Finished difference Result 26397 states and 81223 transitions. [2019-12-07 14:28:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:28:53,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 14:28:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:53,677 INFO L225 Difference]: With dead ends: 26397 [2019-12-07 14:28:53,678 INFO L226 Difference]: Without dead ends: 26397 [2019-12-07 14:28:53,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:28:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26397 states. [2019-12-07 14:28:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26397 to 16499. [2019-12-07 14:28:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16499 states. [2019-12-07 14:28:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16499 states to 16499 states and 51037 transitions. [2019-12-07 14:28:53,978 INFO L78 Accepts]: Start accepts. Automaton has 16499 states and 51037 transitions. Word has length 53 [2019-12-07 14:28:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:53,979 INFO L462 AbstractCegarLoop]: Abstraction has 16499 states and 51037 transitions. [2019-12-07 14:28:53,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:28:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16499 states and 51037 transitions. [2019-12-07 14:28:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:28:53,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:53,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:53,993 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 14:28:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash 814608255, now seen corresponding path program 5 times [2019-12-07 14:28:53,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:53,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181278048] [2019-12-07 14:28:53,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:54,029 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 14:28:54,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181278048] [2019-12-07 14:28:54,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:54,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:54,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330762426] [2019-12-07 14:28:54,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:54,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:54,030 INFO L87 Difference]: Start difference. First operand 16499 states and 51037 transitions. Second operand 3 states. [2019-12-07 14:28:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:54,086 INFO L93 Difference]: Finished difference Result 16497 states and 51032 transitions. [2019-12-07 14:28:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:54,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 14:28:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:54,105 INFO L225 Difference]: With dead ends: 16497 [2019-12-07 14:28:54,105 INFO L226 Difference]: Without dead ends: 16497 [2019-12-07 14:28:54,106 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 14:28:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-07 14:28:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14991. [2019-12-07 14:28:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-12-07 14:28:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 46707 transitions. [2019-12-07 14:28:54,329 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 46707 transitions. Word has length 53 [2019-12-07 14:28:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:54,329 INFO L462 AbstractCegarLoop]: Abstraction has 14991 states and 46707 transitions. [2019-12-07 14:28:54,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 46707 transitions. [2019-12-07 14:28:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:28:54,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:54,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:54,343 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 14:28:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 1 times [2019-12-07 14:28:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:54,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864744761] [2019-12-07 14:28:54,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:54,374 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 14:28:54,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864744761] [2019-12-07 14:28:54,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:54,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782597293] [2019-12-07 14:28:54,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:54,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:54,375 INFO L87 Difference]: Start difference. First operand 14991 states and 46707 transitions. Second operand 3 states. [2019-12-07 14:28:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:54,413 INFO L93 Difference]: Finished difference Result 12892 states and 39619 transitions. [2019-12-07 14:28:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:54,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:28:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:54,426 INFO L225 Difference]: With dead ends: 12892 [2019-12-07 14:28:54,427 INFO L226 Difference]: Without dead ends: 12892 [2019-12-07 14:28:54,427 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 14:28:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12892 states. [2019-12-07 14:28:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12892 to 12436. [2019-12-07 14:28:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12436 states. [2019-12-07 14:28:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12436 states to 12436 states and 38283 transitions. [2019-12-07 14:28:54,600 INFO L78 Accepts]: Start accepts. Automaton has 12436 states and 38283 transitions. Word has length 54 [2019-12-07 14:28:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:54,601 INFO L462 AbstractCegarLoop]: Abstraction has 12436 states and 38283 transitions. [2019-12-07 14:28:54,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 12436 states and 38283 transitions. [2019-12-07 14:28:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:54,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:54,612 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 14:28:54,612 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 14:28:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2064257105, now seen corresponding path program 1 times [2019-12-07 14:28:54,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:54,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076175621] [2019-12-07 14:28:54,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:28:54,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076175621] [2019-12-07 14:28:54,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:54,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:28:54,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569143093] [2019-12-07 14:28:54,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:28:54,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:28:54,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:28:54,754 INFO L87 Difference]: Start difference. First operand 12436 states and 38283 transitions. Second operand 10 states. [2019-12-07 14:28:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:55,554 INFO L93 Difference]: Finished difference Result 53451 states and 163952 transitions. [2019-12-07 14:28:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:28:55,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 14:28:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:55,620 INFO L225 Difference]: With dead ends: 53451 [2019-12-07 14:28:55,621 INFO L226 Difference]: Without dead ends: 50933 [2019-12-07 14:28:55,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:28:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50933 states. [2019-12-07 14:28:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50933 to 15642. [2019-12-07 14:28:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15642 states. [2019-12-07 14:28:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15642 states to 15642 states and 49026 transitions. [2019-12-07 14:28:56,092 INFO L78 Accepts]: Start accepts. Automaton has 15642 states and 49026 transitions. Word has length 55 [2019-12-07 14:28:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:56,092 INFO L462 AbstractCegarLoop]: Abstraction has 15642 states and 49026 transitions. [2019-12-07 14:28:56,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:28:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15642 states and 49026 transitions. [2019-12-07 14:28:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:56,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:56,106 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 14:28:56,107 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 14:28:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 2 times [2019-12-07 14:28:56,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:56,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911536234] [2019-12-07 14:28:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:56,157 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 14:28:56,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911536234] [2019-12-07 14:28:56,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:56,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:28:56,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495163704] [2019-12-07 14:28:56,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:56,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:56,158 INFO L87 Difference]: Start difference. First operand 15642 states and 49026 transitions. Second operand 5 states. [2019-12-07 14:28:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:56,243 INFO L93 Difference]: Finished difference Result 28249 states and 88418 transitions. [2019-12-07 14:28:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:28:56,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 14:28:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:56,258 INFO L225 Difference]: With dead ends: 28249 [2019-12-07 14:28:56,258 INFO L226 Difference]: Without dead ends: 13195 [2019-12-07 14:28:56,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:28:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13195 states. [2019-12-07 14:28:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13195 to 13195. [2019-12-07 14:28:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13195 states. [2019-12-07 14:28:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 41071 transitions. [2019-12-07 14:28:56,440 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 41071 transitions. Word has length 55 [2019-12-07 14:28:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:56,441 INFO L462 AbstractCegarLoop]: Abstraction has 13195 states and 41071 transitions. [2019-12-07 14:28:56,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 41071 transitions. [2019-12-07 14:28:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:56,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:56,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:56,452 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 14:28:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 3 times [2019-12-07 14:28:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:56,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631575923] [2019-12-07 14:28:56,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:56,579 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 14:28:56,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631575923] [2019-12-07 14:28:56,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:56,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:28:56,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259911623] [2019-12-07 14:28:56,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:28:56,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:28:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:28:56,581 INFO L87 Difference]: Start difference. First operand 13195 states and 41071 transitions. Second operand 11 states. [2019-12-07 14:28:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:57,308 INFO L93 Difference]: Finished difference Result 30134 states and 93796 transitions. [2019-12-07 14:28:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 14:28:57,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:28:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:57,345 INFO L225 Difference]: With dead ends: 30134 [2019-12-07 14:28:57,345 INFO L226 Difference]: Without dead ends: 28800 [2019-12-07 14:28:57,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 14:28:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28800 states. [2019-12-07 14:28:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28800 to 19361. [2019-12-07 14:28:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19361 states. [2019-12-07 14:28:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19361 states to 19361 states and 60669 transitions. [2019-12-07 14:28:57,700 INFO L78 Accepts]: Start accepts. Automaton has 19361 states and 60669 transitions. Word has length 55 [2019-12-07 14:28:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:57,700 INFO L462 AbstractCegarLoop]: Abstraction has 19361 states and 60669 transitions. [2019-12-07 14:28:57,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:28:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 19361 states and 60669 transitions. [2019-12-07 14:28:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:57,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:57,718 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 14:28:57,718 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 14:28:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 4 times [2019-12-07 14:28:57,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:57,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186622206] [2019-12-07 14:28:57,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:57,857 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 14:28:57,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186622206] [2019-12-07 14:28:57,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:57,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:28:57,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842311800] [2019-12-07 14:28:57,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:28:57,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:57,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:28:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:28:57,859 INFO L87 Difference]: Start difference. First operand 19361 states and 60669 transitions. Second operand 11 states. [2019-12-07 14:28:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:58,542 INFO L93 Difference]: Finished difference Result 29476 states and 91212 transitions. [2019-12-07 14:28:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:28:58,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:28:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:58,565 INFO L225 Difference]: With dead ends: 29476 [2019-12-07 14:28:58,565 INFO L226 Difference]: Without dead ends: 22309 [2019-12-07 14:28:58,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:28:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22309 states. [2019-12-07 14:28:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22309 to 15218. [2019-12-07 14:28:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15218 states. [2019-12-07 14:28:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 46650 transitions. [2019-12-07 14:28:58,824 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 46650 transitions. Word has length 55 [2019-12-07 14:28:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:58,824 INFO L462 AbstractCegarLoop]: Abstraction has 15218 states and 46650 transitions. [2019-12-07 14:28:58,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:28:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 46650 transitions. [2019-12-07 14:28:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:58,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:58,837 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 14:28:58,837 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 14:28:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 5 times [2019-12-07 14:28:58,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:58,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142949839] [2019-12-07 14:28:58,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:58,963 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 14:28:58,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142949839] [2019-12-07 14:28:58,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:58,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:28:58,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054393049] [2019-12-07 14:28:58,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:28:58,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:28:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:28:58,965 INFO L87 Difference]: Start difference. First operand 15218 states and 46650 transitions. Second operand 12 states. [2019-12-07 14:28:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:59,615 INFO L93 Difference]: Finished difference Result 22773 states and 68875 transitions. [2019-12-07 14:28:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:28:59,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 14:28:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:59,638 INFO L225 Difference]: With dead ends: 22773 [2019-12-07 14:28:59,638 INFO L226 Difference]: Without dead ends: 21655 [2019-12-07 14:28:59,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:28:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21655 states. [2019-12-07 14:28:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21655 to 14767. [2019-12-07 14:28:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14767 states. [2019-12-07 14:28:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14767 states to 14767 states and 45421 transitions. [2019-12-07 14:28:59,898 INFO L78 Accepts]: Start accepts. Automaton has 14767 states and 45421 transitions. Word has length 55 [2019-12-07 14:28:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:59,898 INFO L462 AbstractCegarLoop]: Abstraction has 14767 states and 45421 transitions. [2019-12-07 14:28:59,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:28:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 14767 states and 45421 transitions. [2019-12-07 14:28:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:28:59,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:59,911 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 14:28:59,911 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 14:28:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 6 times [2019-12-07 14:28:59,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:59,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433413828] [2019-12-07 14:28:59,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:28:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:28:59,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:28:59,973 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:28:59,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, 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_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:28:59,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-07 14:28:59,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:28:59,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0_#in~arg.offset_In-337019291| P1Thread1of1ForFork0_~arg.offset_Out-337019291) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291| (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-337019291 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out-337019291 256))))) 1 0)) (= 1 ~x$w_buff0_used~0_Out-337019291) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291) (= ~x$w_buff0~0_Out-337019291 1) (= ~x$w_buff1~0_Out-337019291 ~x$w_buff0~0_In-337019291) (= P1Thread1of1ForFork0_~arg.base_Out-337019291 |P1Thread1of1ForFork0_#in~arg.base_In-337019291|) (= ~x$w_buff0_used~0_In-337019291 ~x$w_buff1_used~0_Out-337019291) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-337019291, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-337019291|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-337019291|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-337019291, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-337019291, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-337019291, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-337019291|, ~x$w_buff1~0=~x$w_buff1~0_Out-337019291, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-337019291} 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 14:28:59,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In717503525 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In717503525 256)))) (or (and (= ~x$w_buff1~0_In717503525 |P2Thread1of1ForFork1_#t~ite32_Out717503525|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In717503525 |P2Thread1of1ForFork1_#t~ite32_Out717503525|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In717503525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In717503525, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In717503525, ~x~0=~x~0_In717503525} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out717503525|, ~x$w_buff1~0=~x$w_buff1~0_In717503525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In717503525, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In717503525, ~x~0=~x~0_In717503525} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:28:59,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:28:59,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1742421046 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1742421046 256) 0))) (or (and (= ~x$w_buff0_used~0_In1742421046 |P2Thread1of1ForFork1_#t~ite34_Out1742421046|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1742421046|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1742421046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1742421046} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1742421046|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1742421046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1742421046} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:28:59,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-791148359 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-791148359 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-791148359| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-791148359| ~x$w_buff0_used~0_In-791148359)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-791148359, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-791148359|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:28:59,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1147783629 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1147783629 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1147783629 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1147783629 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1147783629| ~x$w_buff1_used~0_In1147783629) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1147783629| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1147783629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1147783629, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147783629} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1147783629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1147783629, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1147783629|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147783629} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:28:59,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1660523909 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In1660523909 ~x$r_buff0_thd2~0_Out1660523909)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1660523909 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1660523909) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1660523909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1660523909} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1660523909|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1660523909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1660523909} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:28:59,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1858809408 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1858809408 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1858809408 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1858809408 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1858809408|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In1858809408 |P1Thread1of1ForFork0_#t~ite31_Out1858809408|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1858809408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1858809408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1858809408|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1858809408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1858809408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:28:59,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 14:28:59,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1503583249 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-1503583249| ~x$w_buff1~0_In-1503583249) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1503583249 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1503583249 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-1503583249 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1503583249 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite11_Out-1503583249| |P0Thread1of1ForFork2_#t~ite12_Out-1503583249|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1503583249| |P0Thread1of1ForFork2_#t~ite11_Out-1503583249|) (= ~x$w_buff1~0_In-1503583249 |P0Thread1of1ForFork2_#t~ite12_Out-1503583249|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1503583249, ~x$w_buff1~0=~x$w_buff1~0_In-1503583249, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503583249, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1503583249, ~weak$$choice2~0=~weak$$choice2~0_In-1503583249, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1503583249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503583249} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1503583249, ~x$w_buff1~0=~x$w_buff1~0_In-1503583249, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503583249, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1503583249, ~weak$$choice2~0=~weak$$choice2~0_In-1503583249, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1503583249|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1503583249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503583249} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:28:59,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1312607605 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1312607605| |P0Thread1of1ForFork2_#t~ite14_Out1312607605|) (not .cse0) (= ~x$w_buff0_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite15_Out1312607605|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out1312607605| |P0Thread1of1ForFork2_#t~ite15_Out1312607605|) (= ~x$w_buff0_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite14_Out1312607605|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1312607605 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1312607605 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1312607605 256))) (= 0 (mod ~x$w_buff0_used~0_In1312607605 256)))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1312607605|, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1312607605|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1312607605|, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:28:59,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-392446159 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-392446159| |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (= ~x$w_buff1_used~0_In-392446159 |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-392446159 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-392446159 256))) (= 0 (mod ~x$w_buff0_used~0_In-392446159 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-392446159 256) 0))))) (and (= |P0Thread1of1ForFork2_#t~ite17_In-392446159| |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (= |P0Thread1of1ForFork2_#t~ite18_Out-392446159| ~x$w_buff1_used~0_In-392446159) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392446159, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-392446159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392446159, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392446159, ~weak$$choice2~0=~weak$$choice2~0_In-392446159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392446159} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392446159, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-392446159|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-392446159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392446159, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392446159, ~weak$$choice2~0=~weak$$choice2~0_In-392446159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392446159} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:28:59,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:28:59,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:28:59,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In108298849 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In108298849 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In108298849 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In108298849 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out108298849|)) (and (= ~x$w_buff1_used~0_In108298849 |P2Thread1of1ForFork1_#t~ite35_Out108298849|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In108298849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In108298849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:28:59,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-513326958 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-513326958| ~x$r_buff0_thd3~0_In-513326958) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-513326958| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-513326958|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:28:59,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In912277522 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In912277522 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In912277522 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In912277522 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out912277522| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out912277522| ~x$r_buff1_thd3~0_In912277522) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In912277522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In912277522, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In912277522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912277522} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out912277522|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In912277522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In912277522, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In912277522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912277522} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:28:59,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 14:28:59,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:28:59,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-167468437 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-167468437 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-167468437| ~x$w_buff1~0_In-167468437)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-167468437| ~x~0_In-167468437)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-167468437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-167468437, ~x~0=~x~0_In-167468437} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-167468437|, ~x$w_buff1~0=~x$w_buff1~0_In-167468437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-167468437, ~x~0=~x~0_In-167468437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:28:59,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:28:59,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In369661034 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In369661034 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out369661034| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out369661034| ~x$w_buff0_used~0_In369661034)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In369661034, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out369661034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:28:59,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1696084617 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1696084617 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1696084617 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1696084617 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1696084617| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out-1696084617| ~x$w_buff1_used~0_In-1696084617) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1696084617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696084617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696084617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696084617} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1696084617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696084617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696084617, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1696084617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696084617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:28:59,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1375124403 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1375124403 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1375124403| ~x$r_buff0_thd0~0_In1375124403) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1375124403| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1375124403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:28:59,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In763618595 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In763618595 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In763618595 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In763618595 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out763618595| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out763618595| ~x$r_buff1_thd0~0_In763618595) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In763618595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In763618595, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out763618595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:28:59,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 14:29:00,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:29:00 BasicIcfg [2019-12-07 14:29:00,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:29:00,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:29:00,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:29:00,030 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:29:00,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:27:23" (3/4) ... [2019-12-07 14:29:00,032 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:29:00,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, 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_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:29:00,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-07 14:29:00,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:29:00,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0_#in~arg.offset_In-337019291| P1Thread1of1ForFork0_~arg.offset_Out-337019291) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291| (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-337019291 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out-337019291 256))))) 1 0)) (= 1 ~x$w_buff0_used~0_Out-337019291) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291) (= ~x$w_buff0~0_Out-337019291 1) (= ~x$w_buff1~0_Out-337019291 ~x$w_buff0~0_In-337019291) (= P1Thread1of1ForFork0_~arg.base_Out-337019291 |P1Thread1of1ForFork0_#in~arg.base_In-337019291|) (= ~x$w_buff0_used~0_In-337019291 ~x$w_buff1_used~0_Out-337019291) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-337019291, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-337019291|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-337019291|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337019291} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-337019291, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-337019291, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-337019291, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-337019291, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-337019291|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-337019291|, ~x$w_buff1~0=~x$w_buff1~0_Out-337019291, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-337019291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-337019291, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-337019291} 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 14:29:00,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In717503525 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In717503525 256)))) (or (and (= ~x$w_buff1~0_In717503525 |P2Thread1of1ForFork1_#t~ite32_Out717503525|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In717503525 |P2Thread1of1ForFork1_#t~ite32_Out717503525|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In717503525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In717503525, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In717503525, ~x~0=~x~0_In717503525} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out717503525|, ~x$w_buff1~0=~x$w_buff1~0_In717503525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In717503525, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In717503525, ~x~0=~x~0_In717503525} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:29:00,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:29:00,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1742421046 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1742421046 256) 0))) (or (and (= ~x$w_buff0_used~0_In1742421046 |P2Thread1of1ForFork1_#t~ite34_Out1742421046|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1742421046|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1742421046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1742421046} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1742421046|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1742421046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1742421046} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:29:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-791148359 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-791148359 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-791148359| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-791148359| ~x$w_buff0_used~0_In-791148359)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-791148359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-791148359, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-791148359|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791148359} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:29:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1147783629 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1147783629 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1147783629 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1147783629 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1147783629| ~x$w_buff1_used~0_In1147783629) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1147783629| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1147783629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1147783629, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147783629} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1147783629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1147783629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1147783629, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1147783629|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1147783629} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:29:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1660523909 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In1660523909 ~x$r_buff0_thd2~0_Out1660523909)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1660523909 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1660523909) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1660523909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1660523909} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1660523909|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1660523909, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1660523909} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:29:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1858809408 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1858809408 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1858809408 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1858809408 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1858809408|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In1858809408 |P1Thread1of1ForFork0_#t~ite31_Out1858809408|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1858809408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1858809408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1858809408|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1858809408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1858809408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:29:00,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 14:29:00,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1503583249 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-1503583249| ~x$w_buff1~0_In-1503583249) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1503583249 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1503583249 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-1503583249 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1503583249 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite11_Out-1503583249| |P0Thread1of1ForFork2_#t~ite12_Out-1503583249|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1503583249| |P0Thread1of1ForFork2_#t~ite11_Out-1503583249|) (= ~x$w_buff1~0_In-1503583249 |P0Thread1of1ForFork2_#t~ite12_Out-1503583249|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1503583249, ~x$w_buff1~0=~x$w_buff1~0_In-1503583249, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503583249, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1503583249, ~weak$$choice2~0=~weak$$choice2~0_In-1503583249, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1503583249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503583249} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1503583249, ~x$w_buff1~0=~x$w_buff1~0_In-1503583249, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503583249, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1503583249, ~weak$$choice2~0=~weak$$choice2~0_In-1503583249, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1503583249|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1503583249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503583249} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:29:00,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1312607605 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1312607605| |P0Thread1of1ForFork2_#t~ite14_Out1312607605|) (not .cse0) (= ~x$w_buff0_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite15_Out1312607605|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out1312607605| |P0Thread1of1ForFork2_#t~ite15_Out1312607605|) (= ~x$w_buff0_used~0_In1312607605 |P0Thread1of1ForFork2_#t~ite14_Out1312607605|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1312607605 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1312607605 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1312607605 256))) (= 0 (mod ~x$w_buff0_used~0_In1312607605 256)))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1312607605|, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1312607605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312607605, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1312607605|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1312607605, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1312607605|, ~weak$$choice2~0=~weak$$choice2~0_In1312607605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312607605} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:29:00,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-392446159 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out-392446159| |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (= ~x$w_buff1_used~0_In-392446159 |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-392446159 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-392446159 256))) (= 0 (mod ~x$w_buff0_used~0_In-392446159 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-392446159 256) 0))))) (and (= |P0Thread1of1ForFork2_#t~ite17_In-392446159| |P0Thread1of1ForFork2_#t~ite17_Out-392446159|) (= |P0Thread1of1ForFork2_#t~ite18_Out-392446159| ~x$w_buff1_used~0_In-392446159) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392446159, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-392446159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392446159, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392446159, ~weak$$choice2~0=~weak$$choice2~0_In-392446159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392446159} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-392446159, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-392446159|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-392446159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392446159, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-392446159, ~weak$$choice2~0=~weak$$choice2~0_In-392446159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392446159} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:29:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:29:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:29:00,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In108298849 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In108298849 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In108298849 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In108298849 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out108298849|)) (and (= ~x$w_buff1_used~0_In108298849 |P2Thread1of1ForFork1_#t~ite35_Out108298849|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In108298849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In108298849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:29:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-513326958 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-513326958| ~x$r_buff0_thd3~0_In-513326958) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-513326958| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-513326958|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:29:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In912277522 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In912277522 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In912277522 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In912277522 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out912277522| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out912277522| ~x$r_buff1_thd3~0_In912277522) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In912277522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In912277522, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In912277522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912277522} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out912277522|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In912277522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In912277522, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In912277522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912277522} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:29:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 14:29:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:29:00,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-167468437 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-167468437 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-167468437| ~x$w_buff1~0_In-167468437)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-167468437| ~x~0_In-167468437)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-167468437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-167468437, ~x~0=~x~0_In-167468437} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-167468437|, ~x$w_buff1~0=~x$w_buff1~0_In-167468437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-167468437, ~x~0=~x~0_In-167468437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:29:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:29:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In369661034 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In369661034 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out369661034| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out369661034| ~x$w_buff0_used~0_In369661034)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In369661034, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out369661034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:29:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1696084617 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1696084617 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1696084617 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1696084617 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1696084617| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out-1696084617| ~x$w_buff1_used~0_In-1696084617) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1696084617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696084617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696084617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696084617} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1696084617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696084617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1696084617, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1696084617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696084617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:29:00,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1375124403 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1375124403 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1375124403| ~x$r_buff0_thd0~0_In1375124403) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1375124403| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1375124403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:29:00,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In763618595 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In763618595 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In763618595 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In763618595 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out763618595| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out763618595| ~x$r_buff1_thd0~0_In763618595) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In763618595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In763618595, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out763618595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In763618595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:29:00,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 14:29:00,089 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_570b2012-89d5-40d4-802f-89dce1534fbf/bin/uautomizer/witness.graphml [2019-12-07 14:29:00,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:29:00,090 INFO L168 Benchmark]: Toolchain (without parser) took 97727.66 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 941.4 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,090 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:29:00,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,091 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:29:00,091 INFO L168 Benchmark]: RCFGBuilder took 387.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,092 INFO L168 Benchmark]: TraceAbstraction took 96843.30 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,092 INFO L168 Benchmark]: Witness Printer took 58.97 ms. Allocated memory is still 6.4 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:00,093 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96843.30 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 58.97 ms. Allocated memory is still 6.4 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2360, ((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, z=0] [L822] FCALL, FORK 0 pthread_create(&t2361, ((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, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2362, ((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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4025 SDtfs, 6126 SDslu, 12635 SDs, 0 SdLazy, 6833 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 36 SyntacticMatches, 22 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230207occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 62.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 251020 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 781 ConstructedInterpolants, 0 QuantifiedInterpolants, 168879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...