./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.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_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/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 07a3ffd940f844bfa1442e50e33882906711f5f6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:08:33,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:08:33,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:08:33,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:08:33,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:08:33,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:08:33,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:08:33,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:08:33,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:08:33,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:08:33,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:08:33,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:08:33,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:08:33,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:08:33,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:08:33,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:08:33,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:08:33,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:08:33,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:08:33,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:08:33,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:08:33,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:08:33,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:08:33,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:08:33,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:08:33,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:08:33,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:08:33,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:08:33,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:08:33,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:08:33,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:08:33,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:08:33,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:08:33,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:08:33,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:08:33,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:08:33,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:08:33,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:08:33,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:08:33,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:08:33,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:08:33,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:08:33,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:08:33,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:08:33,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:08:33,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:08:33,898 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:08:33,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:08:33,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:08:33,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:08:33,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:08:33,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:08:33,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:08:33,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:08:33,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:08:33,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:08:33,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:33,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:08:33,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:08:33,901 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_86f3b454-01c5-47d1-8418-017a71f361b4/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 -> 07a3ffd940f844bfa1442e50e33882906711f5f6 [2019-12-07 16:08:34,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:08:34,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:08:34,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:08:34,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:08:34,011 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:08:34,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt.i [2019-12-07 16:08:34,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/data/48896ca15/6cb43716ffc04f7e8e89551e676e57c3/FLAGf0047e4c5 [2019-12-07 16:08:34,497 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:08:34,497 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/sv-benchmarks/c/pthread-wmm/safe002_power.opt.i [2019-12-07 16:08:34,508 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/data/48896ca15/6cb43716ffc04f7e8e89551e676e57c3/FLAGf0047e4c5 [2019-12-07 16:08:34,517 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/data/48896ca15/6cb43716ffc04f7e8e89551e676e57c3 [2019-12-07 16:08:34,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:08:34,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:08:34,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:34,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:08:34,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:08:34,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34, skipping insertion in model container [2019-12-07 16:08:34,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:08:34,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:34,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:34,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:08:34,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:34,893 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:08:34,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34 WrapperNode [2019-12-07 16:08:34,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:34,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:34,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:08:34,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:08:34,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:34,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:08:34,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:08:34,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:08:34,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... [2019-12-07 16:08:34,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:08:34,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:08:34,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:08:34,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:08:34,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/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 16:08:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:08:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:08:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:08:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:08:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:08:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:08:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:08:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:08:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:08:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:08:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:08:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:08:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:08:35,003 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 16:08:35,352 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:08:35,352 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:08:35,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:35 BoogieIcfgContainer [2019-12-07 16:08:35,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:08:35,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:08:35,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:08:35,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:08:35,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:08:34" (1/3) ... [2019-12-07 16:08:35,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135e627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:08:35, skipping insertion in model container [2019-12-07 16:08:35,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:34" (2/3) ... [2019-12-07 16:08:35,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135e627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:08:35, skipping insertion in model container [2019-12-07 16:08:35,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:35" (3/3) ... [2019-12-07 16:08:35,358 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-07 16:08:35,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:08:35,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:08:35,369 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:08:35,370 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:08:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:08:35,437 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:08:35,450 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:08:35,450 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:08:35,450 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:08:35,450 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:08:35,450 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:08:35,450 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:08:35,450 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:08:35,450 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:08:35,461 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 16:08:35,462 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 16:08:35,514 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 16:08:35,514 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:08:35,524 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 16:08:35,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 16:08:35,568 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 16:08:35,568 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:08:35,573 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 16:08:35,586 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 16:08:35,587 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:08:38,603 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 16:08:38,705 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-07 16:08:38,705 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 16:08:38,708 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-07 16:08:47,000 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-07 16:08:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-07 16:08:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:08:47,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:47,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:08:47,006 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 16:08:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-07 16:08:47,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:47,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398783409] [2019-12-07 16:08:47,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:47,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 16:08:47,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398783409] [2019-12-07 16:08:47,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:47,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:08:47,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190937301] [2019-12-07 16:08:47,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:08:47,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:08:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:08:47,172 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-07 16:08:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:47,818 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-07 16:08:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:08:47,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 16:08:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:48,251 INFO L225 Difference]: With dead ends: 79498 [2019-12-07 16:08:48,251 INFO L226 Difference]: Without dead ends: 74626 [2019-12-07 16:08:48,252 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 16:08:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-07 16:08:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-07 16:08:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-07 16:08:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-07 16:08:51,971 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-07 16:08:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:51,972 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-07 16:08:51,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:08:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-07 16:08:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:08:51,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:51,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:51,978 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 16:08:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-07 16:08:51,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:51,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052693439] [2019-12-07 16:08:51,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:52,031 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 16:08:52,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052693439] [2019-12-07 16:08:52,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:52,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:08:52,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996847911] [2019-12-07 16:08:52,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:08:52,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:08:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:08:52,033 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-07 16:08:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:52,134 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-07 16:08:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:08:52,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 16:08:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:52,175 INFO L225 Difference]: With dead ends: 19918 [2019-12-07 16:08:52,175 INFO L226 Difference]: Without dead ends: 19918 [2019-12-07 16:08:52,176 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 16:08:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-07 16:08:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-07 16:08:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-07 16:08:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-07 16:08:52,534 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-07 16:08:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:52,534 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-07 16:08:52,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:08:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-07 16:08:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:08:52,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:52,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:52,536 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 16:08:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-07 16:08:52,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:52,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74507078] [2019-12-07 16:08:52,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:52,591 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 16:08:52,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74507078] [2019-12-07 16:08:52,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:52,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:08:52,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613639314] [2019-12-07 16:08:52,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:08:52,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:08:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:08:52,593 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-07 16:08:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:52,819 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-07 16:08:52,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:08:52,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:08:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:52,872 INFO L225 Difference]: With dead ends: 29603 [2019-12-07 16:08:52,872 INFO L226 Difference]: Without dead ends: 29589 [2019-12-07 16:08:52,872 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 16:08:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-07 16:08:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-07 16:08:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-07 16:08:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-07 16:08:54,157 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-07 16:08:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:54,158 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-07 16:08:54,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:08:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-07 16:08:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:08:54,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:54,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:54,159 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 16:08:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-07 16:08:54,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:54,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757110054] [2019-12-07 16:08:54,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:54,216 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 16:08:54,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757110054] [2019-12-07 16:08:54,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:54,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:08:54,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814290738] [2019-12-07 16:08:54,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:08:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:08:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:08:54,218 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-07 16:08:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:54,534 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-07 16:08:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:08:54,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 16:08:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:54,599 INFO L225 Difference]: With dead ends: 40028 [2019-12-07 16:08:54,599 INFO L226 Difference]: Without dead ends: 40010 [2019-12-07 16:08:54,599 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 16:08:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-07 16:08:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-07 16:08:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-07 16:08:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-07 16:08:55,301 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-07 16:08:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:55,302 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-07 16:08:55,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:08:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-07 16:08:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:08:55,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:55,309 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 16:08:55,309 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 16:08:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-07 16:08:55,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:55,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986198579] [2019-12-07 16:08:55,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:55,389 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 16:08:55,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986198579] [2019-12-07 16:08:55,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:55,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:08:55,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520983450] [2019-12-07 16:08:55,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:08:55,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:08:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:08:55,391 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-07 16:08:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:55,993 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-07 16:08:55,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:08:55,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 16:08:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:56,085 INFO L225 Difference]: With dead ends: 54414 [2019-12-07 16:08:56,085 INFO L226 Difference]: Without dead ends: 54384 [2019-12-07 16:08:56,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:08:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-07 16:08:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-07 16:08:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-07 16:08:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-07 16:08:56,826 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-07 16:08:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:56,826 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-07 16:08:56,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:08:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-07 16:08:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:08:56,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:56,833 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 16:08:56,833 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 16:08:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-07 16:08:56,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:56,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598357649] [2019-12-07 16:08:56,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:08:56,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598357649] [2019-12-07 16:08:56,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:56,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:08:56,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420512295] [2019-12-07 16:08:56,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:08:56,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:56,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:08:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:08:56,923 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-07 16:08:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:57,659 INFO L93 Difference]: Finished difference Result 56211 states and 182423 transitions. [2019-12-07 16:08:57,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:08:57,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 16:08:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:57,746 INFO L225 Difference]: With dead ends: 56211 [2019-12-07 16:08:57,746 INFO L226 Difference]: Without dead ends: 56181 [2019-12-07 16:08:57,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:08:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56181 states. [2019-12-07 16:08:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56181 to 35539. [2019-12-07 16:08:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35539 states. [2019-12-07 16:08:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35539 states to 35539 states and 117693 transitions. [2019-12-07 16:08:58,549 INFO L78 Accepts]: Start accepts. Automaton has 35539 states and 117693 transitions. Word has length 22 [2019-12-07 16:08:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:58,550 INFO L462 AbstractCegarLoop]: Abstraction has 35539 states and 117693 transitions. [2019-12-07 16:08:58,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:08:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35539 states and 117693 transitions. [2019-12-07 16:08:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:08:58,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:58,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:58,560 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 16:08:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-07 16:08:58,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:58,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756831566] [2019-12-07 16:08:58,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:58,604 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 16:08:58,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756831566] [2019-12-07 16:08:58,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:58,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:08:58,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149621771] [2019-12-07 16:08:58,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:08:58,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:08:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:08:58,606 INFO L87 Difference]: Start difference. First operand 35539 states and 117693 transitions. Second operand 4 states. [2019-12-07 16:08:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:58,660 INFO L93 Difference]: Finished difference Result 14114 states and 43412 transitions. [2019-12-07 16:08:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:08:58,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 16:08:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:58,677 INFO L225 Difference]: With dead ends: 14114 [2019-12-07 16:08:58,677 INFO L226 Difference]: Without dead ends: 14114 [2019-12-07 16:08:58,678 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 16:08:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-07 16:08:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 13924. [2019-12-07 16:08:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13924 states. [2019-12-07 16:08:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13924 states to 13924 states and 42859 transitions. [2019-12-07 16:08:58,871 INFO L78 Accepts]: Start accepts. Automaton has 13924 states and 42859 transitions. Word has length 25 [2019-12-07 16:08:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:58,871 INFO L462 AbstractCegarLoop]: Abstraction has 13924 states and 42859 transitions. [2019-12-07 16:08:58,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:08:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13924 states and 42859 transitions. [2019-12-07 16:08:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:08:58,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:58,890 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 16:08:58,890 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 16:08:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-07 16:08:58,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:58,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34927907] [2019-12-07 16:08:58,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:58,941 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 16:08:58,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34927907] [2019-12-07 16:08:58,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:58,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:08:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074737194] [2019-12-07 16:08:58,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:08:58,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:08:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:08:58,943 INFO L87 Difference]: Start difference. First operand 13924 states and 42859 transitions. Second operand 5 states. [2019-12-07 16:08:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:59,272 INFO L93 Difference]: Finished difference Result 19982 states and 61011 transitions. [2019-12-07 16:08:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:08:59,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 16:08:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:59,294 INFO L225 Difference]: With dead ends: 19982 [2019-12-07 16:08:59,294 INFO L226 Difference]: Without dead ends: 19982 [2019-12-07 16:08:59,294 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 16:08:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19982 states. [2019-12-07 16:08:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19982 to 17669. [2019-12-07 16:08:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17669 states. [2019-12-07 16:08:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 54524 transitions. [2019-12-07 16:08:59,556 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 54524 transitions. Word has length 39 [2019-12-07 16:08:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:59,556 INFO L462 AbstractCegarLoop]: Abstraction has 17669 states and 54524 transitions. [2019-12-07 16:08:59,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:08:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 54524 transitions. [2019-12-07 16:08:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:08:59,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:59,578 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 16:08:59,579 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 16:08:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2135894693, now seen corresponding path program 2 times [2019-12-07 16:08:59,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:59,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234743177] [2019-12-07 16:08:59,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:59,624 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 16:08:59,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234743177] [2019-12-07 16:08:59,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:59,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:08:59,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615434872] [2019-12-07 16:08:59,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:08:59,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:59,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:08:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:08:59,626 INFO L87 Difference]: Start difference. First operand 17669 states and 54524 transitions. Second operand 3 states. [2019-12-07 16:08:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:08:59,688 INFO L93 Difference]: Finished difference Result 16831 states and 51389 transitions. [2019-12-07 16:08:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:08:59,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 16:08:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:08:59,707 INFO L225 Difference]: With dead ends: 16831 [2019-12-07 16:08:59,707 INFO L226 Difference]: Without dead ends: 16831 [2019-12-07 16:08:59,707 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 16:08:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16831 states. [2019-12-07 16:08:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16831 to 16743. [2019-12-07 16:08:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16743 states. [2019-12-07 16:08:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16743 states to 16743 states and 51145 transitions. [2019-12-07 16:08:59,933 INFO L78 Accepts]: Start accepts. Automaton has 16743 states and 51145 transitions. Word has length 39 [2019-12-07 16:08:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:08:59,934 INFO L462 AbstractCegarLoop]: Abstraction has 16743 states and 51145 transitions. [2019-12-07 16:08:59,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:08:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16743 states and 51145 transitions. [2019-12-07 16:08:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:08:59,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:08:59,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:08:59,955 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 16:08:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:08:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-07 16:08:59,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:08:59,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378652029] [2019-12-07 16:08:59,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:08:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:08:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:08:59,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378652029] [2019-12-07 16:08:59,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:08:59,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:08:59,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720087138] [2019-12-07 16:08:59,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:08:59,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:08:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:08:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:08:59,991 INFO L87 Difference]: Start difference. First operand 16743 states and 51145 transitions. Second operand 5 states. [2019-12-07 16:09:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:00,047 INFO L93 Difference]: Finished difference Result 15468 states and 47873 transitions. [2019-12-07 16:09:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:00,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 16:09:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:00,070 INFO L225 Difference]: With dead ends: 15468 [2019-12-07 16:09:00,070 INFO L226 Difference]: Without dead ends: 15468 [2019-12-07 16:09:00,070 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 16:09:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15468 states. [2019-12-07 16:09:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15468 to 14608. [2019-12-07 16:09:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14608 states. [2019-12-07 16:09:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14608 states to 14608 states and 45416 transitions. [2019-12-07 16:09:00,338 INFO L78 Accepts]: Start accepts. Automaton has 14608 states and 45416 transitions. Word has length 40 [2019-12-07 16:09:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:00,339 INFO L462 AbstractCegarLoop]: Abstraction has 14608 states and 45416 transitions. [2019-12-07 16:09:00,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:09:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14608 states and 45416 transitions. [2019-12-07 16:09:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:09:00,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:00,353 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 16:09:00,353 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 16:09:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash 875448344, now seen corresponding path program 1 times [2019-12-07 16:09:00,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:00,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565358951] [2019-12-07 16:09:00,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:00,388 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 16:09:00,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565358951] [2019-12-07 16:09:00,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:00,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:09:00,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375748024] [2019-12-07 16:09:00,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:09:00,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:09:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:00,389 INFO L87 Difference]: Start difference. First operand 14608 states and 45416 transitions. Second operand 3 states. [2019-12-07 16:09:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:00,455 INFO L93 Difference]: Finished difference Result 19445 states and 60569 transitions. [2019-12-07 16:09:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:09:00,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 16:09:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:00,476 INFO L225 Difference]: With dead ends: 19445 [2019-12-07 16:09:00,476 INFO L226 Difference]: Without dead ends: 19445 [2019-12-07 16:09:00,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19445 states. [2019-12-07 16:09:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19445 to 16430. [2019-12-07 16:09:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-12-07 16:09:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 51573 transitions. [2019-12-07 16:09:00,717 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 51573 transitions. Word has length 55 [2019-12-07 16:09:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:00,717 INFO L462 AbstractCegarLoop]: Abstraction has 16430 states and 51573 transitions. [2019-12-07 16:09:00,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:09:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 51573 transitions. [2019-12-07 16:09:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:09:00,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:00,732 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 16:09:00,732 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 16:09:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1829960825, now seen corresponding path program 1 times [2019-12-07 16:09:00,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:00,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551056270] [2019-12-07 16:09:00,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:00,811 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 16:09:00,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551056270] [2019-12-07 16:09:00,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:00,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:09:00,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960798688] [2019-12-07 16:09:00,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:09:00,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:09:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:00,812 INFO L87 Difference]: Start difference. First operand 16430 states and 51573 transitions. Second operand 3 states. [2019-12-07 16:09:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:00,853 INFO L93 Difference]: Finished difference Result 16430 states and 51571 transitions. [2019-12-07 16:09:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:09:00,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 16:09:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:00,871 INFO L225 Difference]: With dead ends: 16430 [2019-12-07 16:09:00,872 INFO L226 Difference]: Without dead ends: 16430 [2019-12-07 16:09:00,872 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 16:09:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16430 states. [2019-12-07 16:09:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16430 to 15363. [2019-12-07 16:09:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15363 states. [2019-12-07 16:09:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15363 states to 15363 states and 48508 transitions. [2019-12-07 16:09:01,098 INFO L78 Accepts]: Start accepts. Automaton has 15363 states and 48508 transitions. Word has length 55 [2019-12-07 16:09:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:01,098 INFO L462 AbstractCegarLoop]: Abstraction has 15363 states and 48508 transitions. [2019-12-07 16:09:01,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:09:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 15363 states and 48508 transitions. [2019-12-07 16:09:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:01,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:01,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:01,114 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 16:09:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1826980617, now seen corresponding path program 1 times [2019-12-07 16:09:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253165692] [2019-12-07 16:09:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:01,155 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 16:09:01,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253165692] [2019-12-07 16:09:01,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:01,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:09:01,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998662690] [2019-12-07 16:09:01,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:01,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:01,156 INFO L87 Difference]: Start difference. First operand 15363 states and 48508 transitions. Second operand 4 states. [2019-12-07 16:09:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:01,235 INFO L93 Difference]: Finished difference Result 28926 states and 91685 transitions. [2019-12-07 16:09:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:09:01,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:09:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:01,251 INFO L225 Difference]: With dead ends: 28926 [2019-12-07 16:09:01,251 INFO L226 Difference]: Without dead ends: 14648 [2019-12-07 16:09:01,252 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 16:09:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14648 states. [2019-12-07 16:09:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14648 to 14648. [2019-12-07 16:09:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14648 states. [2019-12-07 16:09:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14648 states to 14648 states and 46308 transitions. [2019-12-07 16:09:01,455 INFO L78 Accepts]: Start accepts. Automaton has 14648 states and 46308 transitions. Word has length 56 [2019-12-07 16:09:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:01,455 INFO L462 AbstractCegarLoop]: Abstraction has 14648 states and 46308 transitions. [2019-12-07 16:09:01,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14648 states and 46308 transitions. [2019-12-07 16:09:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:01,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:01,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:01,470 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 16:09:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1502708477, now seen corresponding path program 2 times [2019-12-07 16:09:01,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:01,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120181297] [2019-12-07 16:09:01,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:01,509 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 16:09:01,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120181297] [2019-12-07 16:09:01,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:01,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:09:01,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297276442] [2019-12-07 16:09:01,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:01,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:01,511 INFO L87 Difference]: Start difference. First operand 14648 states and 46308 transitions. Second operand 4 states. [2019-12-07 16:09:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:01,617 INFO L93 Difference]: Finished difference Result 39252 states and 125017 transitions. [2019-12-07 16:09:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:01,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 16:09:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:01,627 INFO L225 Difference]: With dead ends: 39252 [2019-12-07 16:09:01,627 INFO L226 Difference]: Without dead ends: 7630 [2019-12-07 16:09:01,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7630 states. [2019-12-07 16:09:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7630 to 7630. [2019-12-07 16:09:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-07 16:09:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24403 transitions. [2019-12-07 16:09:01,735 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24403 transitions. Word has length 56 [2019-12-07 16:09:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:01,735 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24403 transitions. [2019-12-07 16:09:01,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24403 transitions. [2019-12-07 16:09:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:01,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:01,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:01,742 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 16:09:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 3 times [2019-12-07 16:09:01,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:01,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045262686] [2019-12-07 16:09:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:01,927 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 16:09:01,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045262686] [2019-12-07 16:09:01,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:01,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:09:01,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011825857] [2019-12-07 16:09:01,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:09:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:09:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:09:01,928 INFO L87 Difference]: Start difference. First operand 7630 states and 24403 transitions. Second operand 13 states. [2019-12-07 16:09:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:03,715 INFO L93 Difference]: Finished difference Result 18646 states and 57989 transitions. [2019-12-07 16:09:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 16:09:03,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-07 16:09:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:03,725 INFO L225 Difference]: With dead ends: 18646 [2019-12-07 16:09:03,726 INFO L226 Difference]: Without dead ends: 10756 [2019-12-07 16:09:03,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1717, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 16:09:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-07 16:09:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 9151. [2019-12-07 16:09:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-07 16:09:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 28487 transitions. [2019-12-07 16:09:03,860 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 28487 transitions. Word has length 56 [2019-12-07 16:09:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:03,861 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 28487 transitions. [2019-12-07 16:09:03,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:09:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 28487 transitions. [2019-12-07 16:09:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:03,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:03,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:03,869 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 16:09:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 4 times [2019-12-07 16:09:03,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:03,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537181597] [2019-12-07 16:09:03,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:04,309 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 16:09:04,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537181597] [2019-12-07 16:09:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 16:09:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601468042] [2019-12-07 16:09:04,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:09:04,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:09:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:09:04,310 INFO L87 Difference]: Start difference. First operand 9151 states and 28487 transitions. Second operand 15 states. [2019-12-07 16:09:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:07,460 INFO L93 Difference]: Finished difference Result 14342 states and 43863 transitions. [2019-12-07 16:09:07,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 16:09:07,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 16:09:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:07,476 INFO L225 Difference]: With dead ends: 14342 [2019-12-07 16:09:07,476 INFO L226 Difference]: Without dead ends: 13944 [2019-12-07 16:09:07,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=3147, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 16:09:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13944 states. [2019-12-07 16:09:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13944 to 11398. [2019-12-07 16:09:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11398 states. [2019-12-07 16:09:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11398 states to 11398 states and 35324 transitions. [2019-12-07 16:09:07,655 INFO L78 Accepts]: Start accepts. Automaton has 11398 states and 35324 transitions. Word has length 56 [2019-12-07 16:09:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:07,655 INFO L462 AbstractCegarLoop]: Abstraction has 11398 states and 35324 transitions. [2019-12-07 16:09:07,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:09:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11398 states and 35324 transitions. [2019-12-07 16:09:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:07,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:07,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:07,665 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 16:09:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -392165105, now seen corresponding path program 5 times [2019-12-07 16:09:07,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:07,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814111185] [2019-12-07 16:09:07,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:08,044 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 16:09:08,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814111185] [2019-12-07 16:09:08,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:08,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 16:09:08,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108423283] [2019-12-07 16:09:08,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:09:08,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:09:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:09:08,045 INFO L87 Difference]: Start difference. First operand 11398 states and 35324 transitions. Second operand 18 states. [2019-12-07 16:09:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:10,605 INFO L93 Difference]: Finished difference Result 16476 states and 49382 transitions. [2019-12-07 16:09:10,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 16:09:10,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-07 16:09:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:10,632 INFO L225 Difference]: With dead ends: 16476 [2019-12-07 16:09:10,632 INFO L226 Difference]: Without dead ends: 15215 [2019-12-07 16:09:10,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=536, Invalid=2886, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 16:09:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15215 states. [2019-12-07 16:09:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15215 to 11375. [2019-12-07 16:09:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11375 states. [2019-12-07 16:09:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11375 states to 11375 states and 35121 transitions. [2019-12-07 16:09:10,815 INFO L78 Accepts]: Start accepts. Automaton has 11375 states and 35121 transitions. Word has length 56 [2019-12-07 16:09:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:10,815 INFO L462 AbstractCegarLoop]: Abstraction has 11375 states and 35121 transitions. [2019-12-07 16:09:10,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:09:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11375 states and 35121 transitions. [2019-12-07 16:09:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:10,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:10,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:10,825 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 16:09:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -981340017, now seen corresponding path program 6 times [2019-12-07 16:09:10,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:10,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182788592] [2019-12-07 16:09:10,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:10,988 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 16:09:10,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182788592] [2019-12-07 16:09:10,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:10,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:09:10,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896593220] [2019-12-07 16:09:10,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:09:10,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:09:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:09:10,990 INFO L87 Difference]: Start difference. First operand 11375 states and 35121 transitions. Second operand 13 states. [2019-12-07 16:09:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:13,375 INFO L93 Difference]: Finished difference Result 15251 states and 46272 transitions. [2019-12-07 16:09:13,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 16:09:13,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-07 16:09:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:13,401 INFO L225 Difference]: With dead ends: 15251 [2019-12-07 16:09:13,401 INFO L226 Difference]: Without dead ends: 13811 [2019-12-07 16:09:13,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 16:09:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13811 states. [2019-12-07 16:09:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13811 to 11313. [2019-12-07 16:09:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11313 states. [2019-12-07 16:09:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 34950 transitions. [2019-12-07 16:09:13,584 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 34950 transitions. Word has length 56 [2019-12-07 16:09:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:13,585 INFO L462 AbstractCegarLoop]: Abstraction has 11313 states and 34950 transitions. [2019-12-07 16:09:13,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:09:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 34950 transitions. [2019-12-07 16:09:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:13,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:13,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:13,594 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 16:09:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 24576963, now seen corresponding path program 7 times [2019-12-07 16:09:13,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:13,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811668393] [2019-12-07 16:09:13,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:13,755 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 16:09:13,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811668393] [2019-12-07 16:09:13,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:13,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:09:13,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093757922] [2019-12-07 16:09:13,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:09:13,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:09:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:09:13,756 INFO L87 Difference]: Start difference. First operand 11313 states and 34950 transitions. Second operand 11 states. [2019-12-07 16:09:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:14,465 INFO L93 Difference]: Finished difference Result 16037 states and 49113 transitions. [2019-12-07 16:09:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:09:14,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 16:09:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:14,480 INFO L225 Difference]: With dead ends: 16037 [2019-12-07 16:09:14,481 INFO L226 Difference]: Without dead ends: 10216 [2019-12-07 16:09:14,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:09:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10216 states. [2019-12-07 16:09:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10216 to 8942. [2019-12-07 16:09:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8942 states. [2019-12-07 16:09:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8942 states to 8942 states and 27824 transitions. [2019-12-07 16:09:14,614 INFO L78 Accepts]: Start accepts. Automaton has 8942 states and 27824 transitions. Word has length 56 [2019-12-07 16:09:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:14,614 INFO L462 AbstractCegarLoop]: Abstraction has 8942 states and 27824 transitions. [2019-12-07 16:09:14,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:09:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8942 states and 27824 transitions. [2019-12-07 16:09:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 16:09:14,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:14,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:14,622 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 16:09:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 8 times [2019-12-07 16:09:14,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:14,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386037127] [2019-12-07 16:09:14,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:09:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:09:14,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:09:14,695 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:09:14,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39|) |v_ULTIMATE.start_main_~#t1828~0.offset_25| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_25|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1828~0.base_39|) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39|)) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_16|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:09:14,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-07 16:09:14,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 16:09:14,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:09:14,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2047850913 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2047850913 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-2047850913| ~x~0_In-2047850913) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-2047850913 |P2Thread1of1ForFork1_#t~ite32_Out-2047850913|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2047850913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2047850913, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2047850913, ~x~0=~x~0_In-2047850913} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2047850913|, ~x$w_buff1~0=~x$w_buff1~0_In-2047850913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2047850913, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2047850913, ~x~0=~x~0_In-2047850913} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 16:09:14,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1756880087 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1756880087 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1756880087| ~x$w_buff0_used~0_In1756880087) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1756880087| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1756880087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1756880087} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1756880087, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1756880087|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1756880087} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:09:14,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |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_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 16:09:14,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In198796309 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In198796309 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out198796309| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In198796309 |P2Thread1of1ForFork1_#t~ite34_Out198796309|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In198796309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198796309} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out198796309|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In198796309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198796309} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 16:09:14,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In287327932 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In287327932 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In287327932 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In287327932 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In287327932 |P1Thread1of1ForFork0_#t~ite29_Out287327932|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out287327932|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In287327932, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In287327932, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In287327932, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287327932} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In287327932, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In287327932, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In287327932, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out287327932|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287327932} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:09:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In562673419 ~x$r_buff0_thd2~0_Out562673419)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In562673419 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In562673419 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out562673419) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In562673419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In562673419} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out562673419|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out562673419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In562673419} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:09:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1162130272 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1162130272 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1162130272 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1162130272 256)))) (or (and (= ~x$r_buff1_thd2~0_In1162130272 |P1Thread1of1ForFork0_#t~ite31_Out1162130272|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1162130272|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1162130272, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162130272, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162130272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162130272} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1162130272|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1162130272, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162130272, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162130272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162130272} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:09:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, 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 16:09:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-229569110 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-229569110 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-229569110 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-229569110 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-229569110|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-229569110 |P2Thread1of1ForFork1_#t~ite35_Out-229569110|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-229569110, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-229569110, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229569110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229569110} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-229569110|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229569110, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-229569110, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229569110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229569110} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 16:09:14,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In968072109 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In968072109 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In968072109 |P2Thread1of1ForFork1_#t~ite36_Out968072109|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out968072109|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In968072109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968072109} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out968072109|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In968072109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968072109} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 16:09:14,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In577575440 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In577575440 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In577575440 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In577575440 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In577575440 256) 0))) (= |P0Thread1of1ForFork2_#t~ite11_Out577575440| ~x$w_buff1~0_In577575440) (= |P0Thread1of1ForFork2_#t~ite12_Out577575440| |P0Thread1of1ForFork2_#t~ite11_Out577575440|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In577575440| |P0Thread1of1ForFork2_#t~ite11_Out577575440|) (= |P0Thread1of1ForFork2_#t~ite12_Out577575440| ~x$w_buff1~0_In577575440)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In577575440, ~x$w_buff1~0=~x$w_buff1~0_In577575440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577575440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In577575440, ~weak$$choice2~0=~weak$$choice2~0_In577575440, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In577575440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577575440} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In577575440, ~x$w_buff1~0=~x$w_buff1~0_In577575440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577575440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In577575440, ~weak$$choice2~0=~weak$$choice2~0_In577575440, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out577575440|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out577575440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577575440} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:09:14,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1248165338 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-1248165338| |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1248165338 256)))) (or (= (mod ~x$w_buff0_used~0_In-1248165338 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1248165338 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1248165338 256))))) (= ~x$w_buff0_used~0_In-1248165338 |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|)) (and (= |P0Thread1of1ForFork2_#t~ite14_In-1248165338| |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|) (= ~x$w_buff0_used~0_In-1248165338 |P0Thread1of1ForFork2_#t~ite15_Out-1248165338|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1248165338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248165338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1248165338, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1248165338|, ~weak$$choice2~0=~weak$$choice2~0_In-1248165338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248165338} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1248165338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248165338, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1248165338|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1248165338, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1248165338|, ~weak$$choice2~0=~weak$$choice2~0_In-1248165338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248165338} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:09:14,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 16:09:14,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In438798114 256) 0))) (or (and (not .cse0) (= ~x$r_buff1_thd1~0_In438798114 |P0Thread1of1ForFork2_#t~ite24_Out438798114|) (= |P0Thread1of1ForFork2_#t~ite23_In438798114| |P0Thread1of1ForFork2_#t~ite23_Out438798114|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In438798114 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In438798114 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In438798114 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In438798114 256)) .cse1))) .cse0 (= ~x$r_buff1_thd1~0_In438798114 |P0Thread1of1ForFork2_#t~ite23_Out438798114|) (= |P0Thread1of1ForFork2_#t~ite24_Out438798114| |P0Thread1of1ForFork2_#t~ite23_Out438798114|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In438798114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In438798114, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In438798114, ~weak$$choice2~0=~weak$$choice2~0_In438798114, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In438798114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In438798114} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In438798114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In438798114, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In438798114, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out438798114|, ~weak$$choice2~0=~weak$$choice2~0_In438798114, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out438798114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In438798114} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 16:09:14,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:09:14,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-2002457777 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2002457777 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2002457777 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2002457777 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-2002457777| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-2002457777| ~x$r_buff1_thd3~0_In-2002457777)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002457777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2002457777, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2002457777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002457777} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2002457777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002457777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2002457777, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2002457777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002457777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 16:09:14,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, 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 16:09:14,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:09:14,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1033163640 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1033163640 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1033163640| |ULTIMATE.start_main_#t~ite42_Out1033163640|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out1033163640| ~x~0_In1033163640)) (and (not .cse1) (= ~x$w_buff1~0_In1033163640 |ULTIMATE.start_main_#t~ite41_Out1033163640|) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1033163640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1033163640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1033163640, ~x~0=~x~0_In1033163640} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1033163640|, ~x$w_buff1~0=~x$w_buff1~0_In1033163640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1033163640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1033163640, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1033163640|, ~x~0=~x~0_In1033163640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 16:09:14,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1988262570 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1988262570 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1988262570| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1988262570| ~x$w_buff0_used~0_In1988262570)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988262570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988262570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988262570, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1988262570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988262570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 16:09:14,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In435039114 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In435039114 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In435039114 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In435039114 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out435039114|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite44_Out435039114| ~x$w_buff1_used~0_In435039114) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435039114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435039114, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435039114, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435039114} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435039114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435039114, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435039114, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out435039114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435039114} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 16:09:14,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1888704854 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1888704854 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1888704854| ~x$r_buff0_thd0~0_In-1888704854) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1888704854| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888704854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888704854} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888704854, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1888704854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888704854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 16:09:14,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2137112048 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2137112048 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2137112048 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2137112048 256)))) (or (and (= ~x$r_buff1_thd0~0_In-2137112048 |ULTIMATE.start_main_#t~ite46_Out-2137112048|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-2137112048|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137112048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137112048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137112048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137112048} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137112048, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2137112048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137112048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137112048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137112048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 16:09:14,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:09:14,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:09:14 BasicIcfg [2019-12-07 16:09:14,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:09:14,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:09:14,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:09:14,756 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:09:14,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:08:35" (3/4) ... [2019-12-07 16:09:14,758 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:09:14,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39|) |v_ULTIMATE.start_main_~#t1828~0.offset_25| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_25|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1828~0.base_39|) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39|)) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_16|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:09:14,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-07 16:09:14,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 16:09:14,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:09:14,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2047850913 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2047850913 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-2047850913| ~x~0_In-2047850913) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-2047850913 |P2Thread1of1ForFork1_#t~ite32_Out-2047850913|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2047850913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2047850913, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2047850913, ~x~0=~x~0_In-2047850913} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2047850913|, ~x$w_buff1~0=~x$w_buff1~0_In-2047850913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2047850913, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2047850913, ~x~0=~x~0_In-2047850913} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 16:09:14,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1756880087 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1756880087 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1756880087| ~x$w_buff0_used~0_In1756880087) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1756880087| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1756880087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1756880087} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1756880087, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1756880087|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1756880087} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:09:14,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |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_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 16:09:14,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In198796309 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In198796309 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out198796309| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In198796309 |P2Thread1of1ForFork1_#t~ite34_Out198796309|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In198796309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198796309} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out198796309|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In198796309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198796309} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 16:09:14,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In287327932 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In287327932 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In287327932 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In287327932 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In287327932 |P1Thread1of1ForFork0_#t~ite29_Out287327932|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out287327932|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In287327932, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In287327932, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In287327932, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287327932} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In287327932, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In287327932, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In287327932, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out287327932|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287327932} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:09:14,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In562673419 ~x$r_buff0_thd2~0_Out562673419)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In562673419 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In562673419 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out562673419) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In562673419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In562673419} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out562673419|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out562673419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In562673419} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:09:14,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1162130272 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1162130272 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1162130272 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1162130272 256)))) (or (and (= ~x$r_buff1_thd2~0_In1162130272 |P1Thread1of1ForFork0_#t~ite31_Out1162130272|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1162130272|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1162130272, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162130272, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162130272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162130272} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1162130272|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1162130272, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162130272, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162130272, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162130272} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:09:14,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, 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 16:09:14,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-229569110 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-229569110 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-229569110 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-229569110 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-229569110|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-229569110 |P2Thread1of1ForFork1_#t~ite35_Out-229569110|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-229569110, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-229569110, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229569110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229569110} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-229569110|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229569110, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-229569110, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229569110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229569110} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 16:09:14,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In968072109 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In968072109 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In968072109 |P2Thread1of1ForFork1_#t~ite36_Out968072109|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out968072109|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In968072109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968072109} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out968072109|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In968072109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968072109} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 16:09:14,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In577575440 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In577575440 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In577575440 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In577575440 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In577575440 256) 0))) (= |P0Thread1of1ForFork2_#t~ite11_Out577575440| ~x$w_buff1~0_In577575440) (= |P0Thread1of1ForFork2_#t~ite12_Out577575440| |P0Thread1of1ForFork2_#t~ite11_Out577575440|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In577575440| |P0Thread1of1ForFork2_#t~ite11_Out577575440|) (= |P0Thread1of1ForFork2_#t~ite12_Out577575440| ~x$w_buff1~0_In577575440)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In577575440, ~x$w_buff1~0=~x$w_buff1~0_In577575440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577575440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In577575440, ~weak$$choice2~0=~weak$$choice2~0_In577575440, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In577575440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577575440} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In577575440, ~x$w_buff1~0=~x$w_buff1~0_In577575440, ~x$w_buff1_used~0=~x$w_buff1_used~0_In577575440, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In577575440, ~weak$$choice2~0=~weak$$choice2~0_In577575440, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out577575440|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out577575440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In577575440} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:09:14,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1248165338 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-1248165338| |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1248165338 256)))) (or (= (mod ~x$w_buff0_used~0_In-1248165338 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1248165338 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1248165338 256))))) (= ~x$w_buff0_used~0_In-1248165338 |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|)) (and (= |P0Thread1of1ForFork2_#t~ite14_In-1248165338| |P0Thread1of1ForFork2_#t~ite14_Out-1248165338|) (= ~x$w_buff0_used~0_In-1248165338 |P0Thread1of1ForFork2_#t~ite15_Out-1248165338|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1248165338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248165338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1248165338, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1248165338|, ~weak$$choice2~0=~weak$$choice2~0_In-1248165338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248165338} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1248165338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1248165338, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1248165338|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1248165338, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1248165338|, ~weak$$choice2~0=~weak$$choice2~0_In-1248165338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1248165338} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:09:14,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In438798114 256) 0))) (or (and (not .cse0) (= ~x$r_buff1_thd1~0_In438798114 |P0Thread1of1ForFork2_#t~ite24_Out438798114|) (= |P0Thread1of1ForFork2_#t~ite23_In438798114| |P0Thread1of1ForFork2_#t~ite23_Out438798114|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In438798114 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In438798114 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In438798114 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In438798114 256)) .cse1))) .cse0 (= ~x$r_buff1_thd1~0_In438798114 |P0Thread1of1ForFork2_#t~ite23_Out438798114|) (= |P0Thread1of1ForFork2_#t~ite24_Out438798114| |P0Thread1of1ForFork2_#t~ite23_Out438798114|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In438798114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In438798114, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In438798114, ~weak$$choice2~0=~weak$$choice2~0_In438798114, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In438798114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In438798114} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In438798114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In438798114, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In438798114, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out438798114|, ~weak$$choice2~0=~weak$$choice2~0_In438798114, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out438798114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In438798114} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-2002457777 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2002457777 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2002457777 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2002457777 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-2002457777| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-2002457777| ~x$r_buff1_thd3~0_In-2002457777)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002457777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2002457777, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2002457777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002457777} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2002457777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002457777, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2002457777, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2002457777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002457777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, 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 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:09:14,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1033163640 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1033163640 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1033163640| |ULTIMATE.start_main_#t~ite42_Out1033163640|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out1033163640| ~x~0_In1033163640)) (and (not .cse1) (= ~x$w_buff1~0_In1033163640 |ULTIMATE.start_main_#t~ite41_Out1033163640|) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1033163640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1033163640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1033163640, ~x~0=~x~0_In1033163640} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1033163640|, ~x$w_buff1~0=~x$w_buff1~0_In1033163640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1033163640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1033163640, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1033163640|, ~x~0=~x~0_In1033163640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 16:09:14,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1988262570 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1988262570 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1988262570| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1988262570| ~x$w_buff0_used~0_In1988262570)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988262570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988262570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988262570, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1988262570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988262570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 16:09:14,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In435039114 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In435039114 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In435039114 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In435039114 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out435039114|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite44_Out435039114| ~x$w_buff1_used~0_In435039114) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435039114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435039114, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435039114, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435039114} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435039114, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435039114, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435039114, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out435039114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435039114} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 16:09:14,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1888704854 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1888704854 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1888704854| ~x$r_buff0_thd0~0_In-1888704854) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1888704854| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888704854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888704854} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888704854, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1888704854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888704854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 16:09:14,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2137112048 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2137112048 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2137112048 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2137112048 256)))) (or (and (= ~x$r_buff1_thd0~0_In-2137112048 |ULTIMATE.start_main_#t~ite46_Out-2137112048|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-2137112048|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137112048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137112048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137112048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137112048} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137112048, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2137112048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2137112048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2137112048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137112048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 16:09:14,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:09:14,815 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_86f3b454-01c5-47d1-8418-017a71f361b4/bin/uautomizer/witness.graphml [2019-12-07 16:09:14,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:09:14,816 INFO L168 Benchmark]: Toolchain (without parser) took 40296.21 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 938.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,816 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:09:14,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,817 INFO L168 Benchmark]: Boogie Preprocessor took 25.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:09:14,817 INFO L168 Benchmark]: RCFGBuilder took 394.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,817 INFO L168 Benchmark]: TraceAbstraction took 39402.58 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,818 INFO L168 Benchmark]: Witness Printer took 58.87 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:09:14,819 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 394.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39402.58 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 58.87 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=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=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3129 SDtfs, 5246 SDslu, 11569 SDs, 0 SdLazy, 11639 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 22 SyntacticMatches, 15 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 69369 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 260057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...