./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/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 7c30476d1682206df73cf5af0c4070fb5370606d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:01:57,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:01:57,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:01:57,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:01:57,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:01:57,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:01:57,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:01:57,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:01:57,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:01:57,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:01:57,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:01:57,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:01:57,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:01:57,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:01:57,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:01:57,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:01:57,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:01:57,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:01:57,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:01:57,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:01:57,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:01:57,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:01:57,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:01:57,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:01:57,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:01:57,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:01:57,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:01:57,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:01:57,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:01:57,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:01:57,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:01:57,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:01:57,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:01:57,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:01:57,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:01:57,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:01:57,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:01:57,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:01:57,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:01:57,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:01:57,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:01:57,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:01:57,917 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:01:57,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:01:57,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:01:57,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:01:57,918 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:01:57,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:01:57,918 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:01:57,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:01:57,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:01:57,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:57,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:01:57,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:01:57,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:01:57,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:01:57,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:01:57,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:01:57,921 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_72515bba-3b93-4224-9084-23746569f90b/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 -> 7c30476d1682206df73cf5af0c4070fb5370606d [2019-12-07 19:01:58,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:01:58,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:01:58,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:01:58,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:01:58,031 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:01:58,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc.i [2019-12-07 19:01:58,078 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/data/642a4d07b/8e1f919bcce144d6a5b5de4633b894b9/FLAG68efc7e1d [2019-12-07 19:01:58,514 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:01:58,514 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/sv-benchmarks/c/pthread-wmm/safe031_power.oepc.i [2019-12-07 19:01:58,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/data/642a4d07b/8e1f919bcce144d6a5b5de4633b894b9/FLAG68efc7e1d [2019-12-07 19:01:58,867 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/data/642a4d07b/8e1f919bcce144d6a5b5de4633b894b9 [2019-12-07 19:01:58,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:01:58,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:01:58,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:58,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:01:58,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:01:58,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:58" (1/1) ... [2019-12-07 19:01:58,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:58, skipping insertion in model container [2019-12-07 19:01:58,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:58" (1/1) ... [2019-12-07 19:01:58,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:01:58,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:59,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:59,194 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:01:59,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:59,278 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:01:59,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59 WrapperNode [2019-12-07 19:01:59,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:59,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:59,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:01:59,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:01:59,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:59,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:01:59,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:01:59,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:01:59,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... [2019-12-07 19:01:59,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:01:59,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:01:59,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:01:59,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:01:59,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/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 19:01:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:01:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:01:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:01:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:01:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:01:59,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:01:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:01:59,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:01:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:01:59,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:01:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:01:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:01:59,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:01:59,387 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 19:01:59,726 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:01:59,726 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:01:59,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:59 BoogieIcfgContainer [2019-12-07 19:01:59,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:01:59,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:01:59,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:01:59,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:01:59,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:01:58" (1/3) ... [2019-12-07 19:01:59,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c19a7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:59, skipping insertion in model container [2019-12-07 19:01:59,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:59" (2/3) ... [2019-12-07 19:01:59,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c19a7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:59, skipping insertion in model container [2019-12-07 19:01:59,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:59" (3/3) ... [2019-12-07 19:01:59,731 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i [2019-12-07 19:01:59,737 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:01:59,737 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:01:59,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:01:59,742 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:01:59,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:59,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:01:59,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:01:59,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:01:59,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:01:59,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:01:59,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:01:59,808 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:01:59,808 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:01:59,808 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:01:59,819 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-07 19:01:59,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 19:01:59,872 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 19:01:59,872 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:01:59,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:01:59,895 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 19:01:59,924 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 19:01:59,924 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:01:59,929 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:01:59,943 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:01:59,944 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:02:03,108 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:02:03,201 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-07 19:02:03,201 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 19:02:03,203 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 19:02:12,617 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-07 19:02:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-07 19:02:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:02:12,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:12,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:02:12,623 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 19:02:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-07 19:02:12,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:12,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707532631] [2019-12-07 19:02:12,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:12,768 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 19:02:12,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707532631] [2019-12-07 19:02:12,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:12,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:02:12,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054051117] [2019-12-07 19:02:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:12,783 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-07 19:02:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:13,398 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-07 19:02:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:13,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:02:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:13,843 INFO L225 Difference]: With dead ends: 82272 [2019-12-07 19:02:13,843 INFO L226 Difference]: Without dead ends: 77232 [2019-12-07 19:02:13,844 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 19:02:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-07 19:02:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-07 19:02:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-07 19:02:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-07 19:02:18,193 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-07 19:02:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:18,194 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-07 19:02:18,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-07 19:02:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:02:18,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:18,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:18,201 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 19:02:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-07 19:02:18,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969896748] [2019-12-07 19:02:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:18,261 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 19:02:18,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969896748] [2019-12-07 19:02:18,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:18,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:18,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377291324] [2019-12-07 19:02:18,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:18,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:18,263 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-07 19:02:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:18,938 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-07 19:02:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:18,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:02:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:19,282 INFO L225 Difference]: With dead ends: 119112 [2019-12-07 19:02:19,282 INFO L226 Difference]: Without dead ends: 119007 [2019-12-07 19:02:19,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-07 19:02:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-07 19:02:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-07 19:02:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-07 19:02:26,026 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-07 19:02:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:26,027 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-07 19:02:26,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-07 19:02:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:02:26,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:26,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:26,030 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 19:02:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:26,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-07 19:02:26,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:26,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146881254] [2019-12-07 19:02:26,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:26,082 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 19:02:26,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146881254] [2019-12-07 19:02:26,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:26,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:26,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693014327] [2019-12-07 19:02:26,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:26,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:26,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:26,084 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 4 states. [2019-12-07 19:02:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:27,127 INFO L93 Difference]: Finished difference Result 158605 states and 645510 transitions. [2019-12-07 19:02:27,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:27,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:02:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:27,527 INFO L225 Difference]: With dead ends: 158605 [2019-12-07 19:02:27,527 INFO L226 Difference]: Without dead ends: 158485 [2019-12-07 19:02:27,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158485 states. [2019-12-07 19:02:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158485 to 134738. [2019-12-07 19:02:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134738 states. [2019-12-07 19:02:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134738 states to 134738 states and 557345 transitions. [2019-12-07 19:02:35,534 INFO L78 Accepts]: Start accepts. Automaton has 134738 states and 557345 transitions. Word has length 13 [2019-12-07 19:02:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:35,535 INFO L462 AbstractCegarLoop]: Abstraction has 134738 states and 557345 transitions. [2019-12-07 19:02:35,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 134738 states and 557345 transitions. [2019-12-07 19:02:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:02:35,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:35,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:35,538 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 19:02:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-07 19:02:35,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:35,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142680496] [2019-12-07 19:02:35,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:35,585 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 19:02:35,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142680496] [2019-12-07 19:02:35,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:35,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:35,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094896878] [2019-12-07 19:02:35,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:35,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:35,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:35,587 INFO L87 Difference]: Start difference. First operand 134738 states and 557345 transitions. Second operand 5 states. [2019-12-07 19:02:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:36,529 INFO L93 Difference]: Finished difference Result 183165 states and 744415 transitions. [2019-12-07 19:02:36,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:02:36,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:02:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:36,981 INFO L225 Difference]: With dead ends: 183165 [2019-12-07 19:02:36,981 INFO L226 Difference]: Without dead ends: 183013 [2019-12-07 19:02:36,981 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 19:02:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183013 states. [2019-12-07 19:02:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183013 to 148564. [2019-12-07 19:02:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148564 states. [2019-12-07 19:02:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148564 states to 148564 states and 613463 transitions. [2019-12-07 19:02:44,021 INFO L78 Accepts]: Start accepts. Automaton has 148564 states and 613463 transitions. Word has length 14 [2019-12-07 19:02:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:44,022 INFO L462 AbstractCegarLoop]: Abstraction has 148564 states and 613463 transitions. [2019-12-07 19:02:44,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 148564 states and 613463 transitions. [2019-12-07 19:02:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:02:44,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:44,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:44,038 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 19:02:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:44,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2099469612, now seen corresponding path program 1 times [2019-12-07 19:02:44,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:44,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485962738] [2019-12-07 19:02:44,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:44,100 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 19:02:44,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485962738] [2019-12-07 19:02:44,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:44,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:44,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967768071] [2019-12-07 19:02:44,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:44,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:44,102 INFO L87 Difference]: Start difference. First operand 148564 states and 613463 transitions. Second operand 3 states. [2019-12-07 19:02:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:44,767 INFO L93 Difference]: Finished difference Result 148564 states and 607673 transitions. [2019-12-07 19:02:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:44,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:02:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:45,145 INFO L225 Difference]: With dead ends: 148564 [2019-12-07 19:02:45,145 INFO L226 Difference]: Without dead ends: 148564 [2019-12-07 19:02:45,145 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 19:02:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148564 states. [2019-12-07 19:02:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148564 to 146584. [2019-12-07 19:02:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146584 states. [2019-12-07 19:02:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146584 states to 146584 states and 600131 transitions. [2019-12-07 19:02:53,715 INFO L78 Accepts]: Start accepts. Automaton has 146584 states and 600131 transitions. Word has length 18 [2019-12-07 19:02:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:53,715 INFO L462 AbstractCegarLoop]: Abstraction has 146584 states and 600131 transitions. [2019-12-07 19:02:53,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 146584 states and 600131 transitions. [2019-12-07 19:02:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:02:53,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:53,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:53,727 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 19:02:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2089612406, now seen corresponding path program 1 times [2019-12-07 19:02:53,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:53,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663100902] [2019-12-07 19:02:53,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:53,788 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 19:02:53,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663100902] [2019-12-07 19:02:53,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:53,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:02:53,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270368021] [2019-12-07 19:02:53,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:53,789 INFO L87 Difference]: Start difference. First operand 146584 states and 600131 transitions. Second operand 3 states. [2019-12-07 19:02:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:54,984 INFO L93 Difference]: Finished difference Result 272448 states and 1107573 transitions. [2019-12-07 19:02:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:54,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:02:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:55,648 INFO L225 Difference]: With dead ends: 272448 [2019-12-07 19:02:55,648 INFO L226 Difference]: Without dead ends: 261792 [2019-12-07 19:02:55,648 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 19:03:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261792 states. [2019-12-07 19:03:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261792 to 250613. [2019-12-07 19:03:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250613 states. [2019-12-07 19:03:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250613 states to 250613 states and 1027376 transitions. [2019-12-07 19:03:05,672 INFO L78 Accepts]: Start accepts. Automaton has 250613 states and 1027376 transitions. Word has length 18 [2019-12-07 19:03:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:05,672 INFO L462 AbstractCegarLoop]: Abstraction has 250613 states and 1027376 transitions. [2019-12-07 19:03:05,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 250613 states and 1027376 transitions. [2019-12-07 19:03:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:03:05,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:05,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:05,695 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 19:03:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1438263838, now seen corresponding path program 1 times [2019-12-07 19:03:05,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:05,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014815749] [2019-12-07 19:03:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:05,718 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 19:03:05,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014815749] [2019-12-07 19:03:05,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:05,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:03:05,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256714775] [2019-12-07 19:03:05,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:05,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:05,719 INFO L87 Difference]: Start difference. First operand 250613 states and 1027376 transitions. Second operand 3 states. [2019-12-07 19:03:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:05,866 INFO L93 Difference]: Finished difference Result 48671 states and 160112 transitions. [2019-12-07 19:03:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:05,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:03:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:05,945 INFO L225 Difference]: With dead ends: 48671 [2019-12-07 19:03:05,945 INFO L226 Difference]: Without dead ends: 48671 [2019-12-07 19:03:05,945 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 19:03:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48671 states. [2019-12-07 19:03:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48671 to 48671. [2019-12-07 19:03:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48671 states. [2019-12-07 19:03:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48671 states to 48671 states and 160112 transitions. [2019-12-07 19:03:06,727 INFO L78 Accepts]: Start accepts. Automaton has 48671 states and 160112 transitions. Word has length 19 [2019-12-07 19:03:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:06,727 INFO L462 AbstractCegarLoop]: Abstraction has 48671 states and 160112 transitions. [2019-12-07 19:03:06,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48671 states and 160112 transitions. [2019-12-07 19:03:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:03:06,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:06,737 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 19:03:06,737 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 19:03:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-07 19:03:06,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:06,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769954424] [2019-12-07 19:03:06,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:06,786 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 19:03:06,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769954424] [2019-12-07 19:03:06,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:06,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:03:06,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820446876] [2019-12-07 19:03:06,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:03:06,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:03:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:03:06,788 INFO L87 Difference]: Start difference. First operand 48671 states and 160112 transitions. Second operand 6 states. [2019-12-07 19:03:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:07,367 INFO L93 Difference]: Finished difference Result 68053 states and 219263 transitions. [2019-12-07 19:03:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:03:07,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:03:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:07,478 INFO L225 Difference]: With dead ends: 68053 [2019-12-07 19:03:07,478 INFO L226 Difference]: Without dead ends: 67939 [2019-12-07 19:03:07,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:03:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67939 states. [2019-12-07 19:03:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67939 to 51075. [2019-12-07 19:03:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51075 states. [2019-12-07 19:03:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51075 states to 51075 states and 167119 transitions. [2019-12-07 19:03:09,482 INFO L78 Accepts]: Start accepts. Automaton has 51075 states and 167119 transitions. Word has length 22 [2019-12-07 19:03:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:09,483 INFO L462 AbstractCegarLoop]: Abstraction has 51075 states and 167119 transitions. [2019-12-07 19:03:09,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:03:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 51075 states and 167119 transitions. [2019-12-07 19:03:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:03:09,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:09,493 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 19:03:09,494 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 19:03:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-07 19:03:09,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:09,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003102296] [2019-12-07 19:03:09,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:09,541 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 19:03:09,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003102296] [2019-12-07 19:03:09,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:09,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:03:09,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943292388] [2019-12-07 19:03:09,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:03:09,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:03:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:03:09,542 INFO L87 Difference]: Start difference. First operand 51075 states and 167119 transitions. Second operand 6 states. [2019-12-07 19:03:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:10,202 INFO L93 Difference]: Finished difference Result 75038 states and 239298 transitions. [2019-12-07 19:03:10,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:03:10,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:03:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:10,320 INFO L225 Difference]: With dead ends: 75038 [2019-12-07 19:03:10,320 INFO L226 Difference]: Without dead ends: 74924 [2019-12-07 19:03:10,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:03:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74924 states. [2019-12-07 19:03:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74924 to 55248. [2019-12-07 19:03:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55248 states. [2019-12-07 19:03:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55248 states to 55248 states and 178792 transitions. [2019-12-07 19:03:11,409 INFO L78 Accepts]: Start accepts. Automaton has 55248 states and 178792 transitions. Word has length 22 [2019-12-07 19:03:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:11,410 INFO L462 AbstractCegarLoop]: Abstraction has 55248 states and 178792 transitions. [2019-12-07 19:03:11,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:03:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 55248 states and 178792 transitions. [2019-12-07 19:03:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:03:11,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:11,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:11,430 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 19:03:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-07 19:03:11,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:11,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850901882] [2019-12-07 19:03:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:11,476 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 19:03:11,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850901882] [2019-12-07 19:03:11,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:11,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:11,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653589159] [2019-12-07 19:03:11,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:03:11,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:03:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:03:11,477 INFO L87 Difference]: Start difference. First operand 55248 states and 178792 transitions. Second operand 5 states. [2019-12-07 19:03:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:11,895 INFO L93 Difference]: Finished difference Result 74024 states and 236084 transitions. [2019-12-07 19:03:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:03:11,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:03:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:12,010 INFO L225 Difference]: With dead ends: 74024 [2019-12-07 19:03:12,010 INFO L226 Difference]: Without dead ends: 73999 [2019-12-07 19:03:12,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:03:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73999 states. [2019-12-07 19:03:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73999 to 65282. [2019-12-07 19:03:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65282 states. [2019-12-07 19:03:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65282 states to 65282 states and 209652 transitions. [2019-12-07 19:03:13,285 INFO L78 Accepts]: Start accepts. Automaton has 65282 states and 209652 transitions. Word has length 25 [2019-12-07 19:03:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:13,286 INFO L462 AbstractCegarLoop]: Abstraction has 65282 states and 209652 transitions. [2019-12-07 19:03:13,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:03:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 65282 states and 209652 transitions. [2019-12-07 19:03:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:03:13,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:13,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:13,314 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 19:03:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1769481889, now seen corresponding path program 1 times [2019-12-07 19:03:13,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:13,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330281074] [2019-12-07 19:03:13,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:13,368 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 19:03:13,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330281074] [2019-12-07 19:03:13,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:13,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:03:13,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155341295] [2019-12-07 19:03:13,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:03:13,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:03:13,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:03:13,369 INFO L87 Difference]: Start difference. First operand 65282 states and 209652 transitions. Second operand 6 states. [2019-12-07 19:03:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:13,885 INFO L93 Difference]: Finished difference Result 85200 states and 270589 transitions. [2019-12-07 19:03:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:03:13,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 19:03:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:14,014 INFO L225 Difference]: With dead ends: 85200 [2019-12-07 19:03:14,014 INFO L226 Difference]: Without dead ends: 85028 [2019-12-07 19:03:14,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:03:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85028 states. [2019-12-07 19:03:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85028 to 67549. [2019-12-07 19:03:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67549 states. [2019-12-07 19:03:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67549 states to 67549 states and 216505 transitions. [2019-12-07 19:03:15,241 INFO L78 Accepts]: Start accepts. Automaton has 67549 states and 216505 transitions. Word has length 28 [2019-12-07 19:03:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:15,241 INFO L462 AbstractCegarLoop]: Abstraction has 67549 states and 216505 transitions. [2019-12-07 19:03:15,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:03:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 67549 states and 216505 transitions. [2019-12-07 19:03:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:03:15,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:15,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:15,271 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 19:03:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1394476543, now seen corresponding path program 1 times [2019-12-07 19:03:15,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:15,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889581531] [2019-12-07 19:03:15,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:15,305 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 19:03:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889581531] [2019-12-07 19:03:15,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:03:15,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245665396] [2019-12-07 19:03:15,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:15,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:15,307 INFO L87 Difference]: Start difference. First operand 67549 states and 216505 transitions. Second operand 3 states. [2019-12-07 19:03:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:15,596 INFO L93 Difference]: Finished difference Result 99550 states and 323277 transitions. [2019-12-07 19:03:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:15,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 19:03:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:15,665 INFO L225 Difference]: With dead ends: 99550 [2019-12-07 19:03:15,665 INFO L226 Difference]: Without dead ends: 44602 [2019-12-07 19:03:15,665 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 19:03:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44602 states. [2019-12-07 19:03:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44602 to 42785. [2019-12-07 19:03:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42785 states. [2019-12-07 19:03:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42785 states to 42785 states and 137282 transitions. [2019-12-07 19:03:16,511 INFO L78 Accepts]: Start accepts. Automaton has 42785 states and 137282 transitions. Word has length 30 [2019-12-07 19:03:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:16,512 INFO L462 AbstractCegarLoop]: Abstraction has 42785 states and 137282 transitions. [2019-12-07 19:03:16,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 42785 states and 137282 transitions. [2019-12-07 19:03:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:03:16,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:16,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:16,531 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 19:03:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:16,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1297629797, now seen corresponding path program 1 times [2019-12-07 19:03:16,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:16,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100193844] [2019-12-07 19:03:16,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:16,563 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 19:03:16,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100193844] [2019-12-07 19:03:16,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:16,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:16,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678614473] [2019-12-07 19:03:16,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:03:16,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:03:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:16,565 INFO L87 Difference]: Start difference. First operand 42785 states and 137282 transitions. Second operand 4 states. [2019-12-07 19:03:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:16,618 INFO L93 Difference]: Finished difference Result 16283 states and 49133 transitions. [2019-12-07 19:03:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:03:16,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 19:03:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:16,638 INFO L225 Difference]: With dead ends: 16283 [2019-12-07 19:03:16,638 INFO L226 Difference]: Without dead ends: 16259 [2019-12-07 19:03:16,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2019-12-07 19:03:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 14559. [2019-12-07 19:03:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2019-12-07 19:03:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 44878 transitions. [2019-12-07 19:03:16,853 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 44878 transitions. Word has length 31 [2019-12-07 19:03:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:16,854 INFO L462 AbstractCegarLoop]: Abstraction has 14559 states and 44878 transitions. [2019-12-07 19:03:16,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:03:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 44878 transitions. [2019-12-07 19:03:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:03:16,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:16,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] [2019-12-07 19:03:16,868 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 19:03:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-07 19:03:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:16,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139454867] [2019-12-07 19:03:16,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:16,943 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 19:03:16,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139454867] [2019-12-07 19:03:16,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:16,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:03:16,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217224091] [2019-12-07 19:03:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:03:16,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:03:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:03:16,944 INFO L87 Difference]: Start difference. First operand 14559 states and 44878 transitions. Second operand 7 states. [2019-12-07 19:03:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:17,348 INFO L93 Difference]: Finished difference Result 18434 states and 54762 transitions. [2019-12-07 19:03:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:03:17,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 19:03:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:17,368 INFO L225 Difference]: With dead ends: 18434 [2019-12-07 19:03:17,368 INFO L226 Difference]: Without dead ends: 18342 [2019-12-07 19:03:17,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:03:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18342 states. [2019-12-07 19:03:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18342 to 14521. [2019-12-07 19:03:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14521 states. [2019-12-07 19:03:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14521 states to 14521 states and 44794 transitions. [2019-12-07 19:03:17,592 INFO L78 Accepts]: Start accepts. Automaton has 14521 states and 44794 transitions. Word has length 40 [2019-12-07 19:03:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:17,592 INFO L462 AbstractCegarLoop]: Abstraction has 14521 states and 44794 transitions. [2019-12-07 19:03:17,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:03:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14521 states and 44794 transitions. [2019-12-07 19:03:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:03:17,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:17,606 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 19:03:17,606 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 19:03:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash -907253271, now seen corresponding path program 2 times [2019-12-07 19:03:17,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:17,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494502026] [2019-12-07 19:03:17,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:17,642 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 19:03:17,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494502026] [2019-12-07 19:03:17,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:17,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:03:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151768544] [2019-12-07 19:03:17,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:03:17,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:03:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:03:17,644 INFO L87 Difference]: Start difference. First operand 14521 states and 44794 transitions. Second operand 5 states. [2019-12-07 19:03:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:17,711 INFO L93 Difference]: Finished difference Result 13013 states and 41145 transitions. [2019-12-07 19:03:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:03:17,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 19:03:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:17,725 INFO L225 Difference]: With dead ends: 13013 [2019-12-07 19:03:17,725 INFO L226 Difference]: Without dead ends: 11461 [2019-12-07 19:03:17,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:03:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-12-07 19:03:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7555. [2019-12-07 19:03:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7555 states. [2019-12-07 19:03:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 24250 transitions. [2019-12-07 19:03:17,866 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 24250 transitions. Word has length 40 [2019-12-07 19:03:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:17,866 INFO L462 AbstractCegarLoop]: Abstraction has 7555 states and 24250 transitions. [2019-12-07 19:03:17,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:03:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 24250 transitions. [2019-12-07 19:03:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:03:17,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:17,873 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 19:03:17,873 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 19:03:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1522477301, now seen corresponding path program 1 times [2019-12-07 19:03:17,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:17,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839898355] [2019-12-07 19:03:17,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:17,904 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 19:03:17,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839898355] [2019-12-07 19:03:17,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:17,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:17,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352730703] [2019-12-07 19:03:17,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:17,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:17,906 INFO L87 Difference]: Start difference. First operand 7555 states and 24250 transitions. Second operand 3 states. [2019-12-07 19:03:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:17,959 INFO L93 Difference]: Finished difference Result 10402 states and 32523 transitions. [2019-12-07 19:03:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:17,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:03:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:17,971 INFO L225 Difference]: With dead ends: 10402 [2019-12-07 19:03:17,971 INFO L226 Difference]: Without dead ends: 10402 [2019-12-07 19:03:17,971 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 19:03:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10402 states. [2019-12-07 19:03:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10402 to 8371. [2019-12-07 19:03:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8371 states. [2019-12-07 19:03:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8371 states to 8371 states and 26698 transitions. [2019-12-07 19:03:18,103 INFO L78 Accepts]: Start accepts. Automaton has 8371 states and 26698 transitions. Word has length 55 [2019-12-07 19:03:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:18,103 INFO L462 AbstractCegarLoop]: Abstraction has 8371 states and 26698 transitions. [2019-12-07 19:03:18,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8371 states and 26698 transitions. [2019-12-07 19:03:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:03:18,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:18,110 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 19:03:18,110 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 19:03:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1759943469, now seen corresponding path program 1 times [2019-12-07 19:03:18,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:18,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079406399] [2019-12-07 19:03:18,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:18,152 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 19:03:18,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079406399] [2019-12-07 19:03:18,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:18,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:03:18,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508847724] [2019-12-07 19:03:18,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:18,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:18,153 INFO L87 Difference]: Start difference. First operand 8371 states and 26698 transitions. Second operand 3 states. [2019-12-07 19:03:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:18,177 INFO L93 Difference]: Finished difference Result 7894 states and 24720 transitions. [2019-12-07 19:03:18,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:18,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:03:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:18,186 INFO L225 Difference]: With dead ends: 7894 [2019-12-07 19:03:18,186 INFO L226 Difference]: Without dead ends: 7894 [2019-12-07 19:03:18,186 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 19:03:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2019-12-07 19:03:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 7614. [2019-12-07 19:03:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2019-12-07 19:03:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 23938 transitions. [2019-12-07 19:03:18,295 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 23938 transitions. Word has length 55 [2019-12-07 19:03:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:18,295 INFO L462 AbstractCegarLoop]: Abstraction has 7614 states and 23938 transitions. [2019-12-07 19:03:18,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 23938 transitions. [2019-12-07 19:03:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:03:18,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:18,301 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 19:03:18,302 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 19:03:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1645756632, now seen corresponding path program 1 times [2019-12-07 19:03:18,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:18,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644548631] [2019-12-07 19:03:18,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:18,349 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 19:03:18,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644548631] [2019-12-07 19:03:18,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:18,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:03:18,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382992454] [2019-12-07 19:03:18,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:03:18,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:18,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:03:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:03:18,351 INFO L87 Difference]: Start difference. First operand 7614 states and 23938 transitions. Second operand 6 states. [2019-12-07 19:03:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:18,522 INFO L93 Difference]: Finished difference Result 22892 states and 71010 transitions. [2019-12-07 19:03:18,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:03:18,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 19:03:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:18,541 INFO L225 Difference]: With dead ends: 22892 [2019-12-07 19:03:18,541 INFO L226 Difference]: Without dead ends: 17372 [2019-12-07 19:03:18,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:03:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17372 states. [2019-12-07 19:03:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17372 to 10223. [2019-12-07 19:03:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10223 states. [2019-12-07 19:03:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10223 states to 10223 states and 32197 transitions. [2019-12-07 19:03:18,734 INFO L78 Accepts]: Start accepts. Automaton has 10223 states and 32197 transitions. Word has length 56 [2019-12-07 19:03:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:18,734 INFO L462 AbstractCegarLoop]: Abstraction has 10223 states and 32197 transitions. [2019-12-07 19:03:18,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:03:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10223 states and 32197 transitions. [2019-12-07 19:03:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:03:18,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:18,744 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 19:03:18,744 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 19:03:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2046427888, now seen corresponding path program 2 times [2019-12-07 19:03:18,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:18,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499277410] [2019-12-07 19:03:18,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:18,794 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 19:03:18,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499277410] [2019-12-07 19:03:18,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:18,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:18,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508485875] [2019-12-07 19:03:18,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:03:18,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:03:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:18,796 INFO L87 Difference]: Start difference. First operand 10223 states and 32197 transitions. Second operand 4 states. [2019-12-07 19:03:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:18,847 INFO L93 Difference]: Finished difference Result 17877 states and 56342 transitions. [2019-12-07 19:03:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:03:18,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 19:03:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:18,855 INFO L225 Difference]: With dead ends: 17877 [2019-12-07 19:03:18,855 INFO L226 Difference]: Without dead ends: 6022 [2019-12-07 19:03:18,855 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 19:03:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2019-12-07 19:03:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 6022. [2019-12-07 19:03:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2019-12-07 19:03:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 18810 transitions. [2019-12-07 19:03:18,945 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 18810 transitions. Word has length 56 [2019-12-07 19:03:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:18,945 INFO L462 AbstractCegarLoop]: Abstraction has 6022 states and 18810 transitions. [2019-12-07 19:03:18,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:03:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 18810 transitions. [2019-12-07 19:03:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:03:18,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:18,951 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 19:03:18,951 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 19:03:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 3 times [2019-12-07 19:03:18,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:18,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107117663] [2019-12-07 19:03:18,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:03:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:03:19,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 19:03:19,021 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:03:19,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30|) |v_ULTIMATE.start_main_~#t2513~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30|) 0) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2513~0.base_30| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2513~0.base_30|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30| 1) |v_#valid_76|) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_17|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_30|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, 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_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_24|, ~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_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~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_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:03:19,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #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_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-07 19:03:19,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} 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 19:03:19,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:03:19,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1931844491 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1931844491 256)))) (or (and (= ~x~0_In1931844491 |P2Thread1of1ForFork1_#t~ite32_Out1931844491|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1931844491| ~x$w_buff1~0_In1931844491) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1931844491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1931844491, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1931844491, ~x~0=~x~0_In1931844491} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1931844491|, ~x$w_buff1~0=~x$w_buff1~0_In1931844491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1931844491, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1931844491, ~x~0=~x~0_In1931844491} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:03:19,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:03:19,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-56748426 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-56748426 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-56748426| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-56748426| ~x$w_buff0_used~0_In-56748426)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-56748426|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:03:19,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In642634852 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In642634852 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In642634852 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In642634852 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out642634852|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In642634852 |P2Thread1of1ForFork1_#t~ite35_Out642634852|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In642634852, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In642634852, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out642634852|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642634852, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In642634852, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:03:19,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-419535407 |P2Thread1of1ForFork1_#t~ite36_Out-419535407|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-419535407|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-419535407|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:03:19,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1521275523 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1521275523 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1521275523 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1521275523| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1521275523| ~x$r_buff1_thd3~0_In1521275523)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1521275523, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1521275523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1521275523, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:03:19,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, 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 19:03:19,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-624175564 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-624175564 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-624175564 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-624175564 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-624175564 256) 0) .cse0))) .cse1 (= ~x$w_buff1~0_In-624175564 |P0Thread1of1ForFork2_#t~ite11_Out-624175564|) (= |P0Thread1of1ForFork2_#t~ite12_Out-624175564| |P0Thread1of1ForFork2_#t~ite11_Out-624175564|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite11_In-624175564| |P0Thread1of1ForFork2_#t~ite11_Out-624175564|) (= |P0Thread1of1ForFork2_#t~ite12_Out-624175564| ~x$w_buff1~0_In-624175564)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-624175564, ~x$w_buff1~0=~x$w_buff1~0_In-624175564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624175564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-624175564, ~weak$$choice2~0=~weak$$choice2~0_In-624175564, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-624175564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-624175564} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-624175564, ~x$w_buff1~0=~x$w_buff1~0_In-624175564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624175564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-624175564, ~weak$$choice2~0=~weak$$choice2~0_In-624175564, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-624175564|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-624175564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-624175564} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:03:19,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In246690306 256)))) (or (and (= ~x$w_buff0_used~0_In246690306 |P0Thread1of1ForFork2_#t~ite15_Out246690306|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In246690306| |P0Thread1of1ForFork2_#t~ite14_Out246690306|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In246690306 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In246690306 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In246690306 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In246690306 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite14_Out246690306| ~x$w_buff0_used~0_In246690306) (= |P0Thread1of1ForFork2_#t~ite14_Out246690306| |P0Thread1of1ForFork2_#t~ite15_Out246690306|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In246690306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In246690306, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In246690306, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In246690306|, ~weak$$choice2~0=~weak$$choice2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In246690306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In246690306, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out246690306|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In246690306, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out246690306|, ~weak$$choice2~0=~weak$$choice2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:03:19,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} 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 19:03:19,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1121392408 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1121392408 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1121392408 256) 0) (and (= (mod ~x$w_buff1_used~0_In-1121392408 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1121392408 256))))) (= |P0Thread1of1ForFork2_#t~ite23_Out-1121392408| ~x$r_buff1_thd1~0_In-1121392408) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out-1121392408| |P0Thread1of1ForFork2_#t~ite23_Out-1121392408|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In-1121392408| |P0Thread1of1ForFork2_#t~ite23_Out-1121392408|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1121392408| ~x$r_buff1_thd1~0_In-1121392408)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1121392408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1121392408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1121392408, ~weak$$choice2~0=~weak$$choice2~0_In-1121392408, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1121392408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1121392408} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1121392408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1121392408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1121392408, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1121392408|, ~weak$$choice2~0=~weak$$choice2~0_In-1121392408, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1121392408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1121392408} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:03:19,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 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_5} 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_5, ~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 19:03:19,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1411863803 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1411863803| ~x$w_buff0_used~0_In-1411863803)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1411863803|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1411863803, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:03:19,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2132147236 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2132147236 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In2132147236 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2132147236 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2132147236| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out2132147236| ~x$w_buff1_used~0_In2132147236)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2132147236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2132147236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2132147236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2132147236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2132147236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2132147236, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2132147236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:03:19,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:03:19,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1897769408 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1897769408 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1897769408 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1897769408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1897769408|)) (and (= ~x$r_buff1_thd2~0_In-1897769408 |P1Thread1of1ForFork0_#t~ite31_Out-1897769408|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1897769408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1897769408|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1897769408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:03:19,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, 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 19:03:19,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:03:19,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out262501188| |ULTIMATE.start_main_#t~ite41_Out262501188|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) .cse1 (not .cse2)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out262501188|, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:03:19,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-490519094| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-490519094| ~x$w_buff0_used~0_In-490519094) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-490519094|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:03:19,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-77900890 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-77900890 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-77900890 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-77900890 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-77900890|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-77900890| ~x$w_buff1_used~0_In-77900890)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-77900890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-77900890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-77900890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77900890} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-77900890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-77900890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-77900890, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-77900890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77900890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:03:19,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In922949385 |ULTIMATE.start_main_#t~ite45_Out922949385|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out922949385| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922949385, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out922949385|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:03:19,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-737869703 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-737869703 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-737869703 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-737869703 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-737869703| ~x$r_buff1_thd0~0_In-737869703) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-737869703| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-737869703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-737869703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-737869703, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-737869703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-737869703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:03:19,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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 19:03:19,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:03:19 BasicIcfg [2019-12-07 19:03:19,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:03:19,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:03:19,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:03:19,095 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:03:19,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:59" (3/4) ... [2019-12-07 19:03:19,097 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:03:19,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30|) |v_ULTIMATE.start_main_~#t2513~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30|) 0) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2513~0.base_30| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2513~0.base_30|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30| 1) |v_#valid_76|) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_17|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_30|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, 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_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_24|, ~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_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~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_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:03:19,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #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_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-07 19:03:19,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} 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 19:03:19,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:03:19,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1931844491 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1931844491 256)))) (or (and (= ~x~0_In1931844491 |P2Thread1of1ForFork1_#t~ite32_Out1931844491|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1931844491| ~x$w_buff1~0_In1931844491) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1931844491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1931844491, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1931844491, ~x~0=~x~0_In1931844491} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1931844491|, ~x$w_buff1~0=~x$w_buff1~0_In1931844491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1931844491, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1931844491, ~x~0=~x~0_In1931844491} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:03:19,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:03:19,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-56748426 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-56748426 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-56748426| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-56748426| ~x$w_buff0_used~0_In-56748426)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-56748426|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:03:19,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In642634852 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In642634852 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In642634852 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In642634852 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out642634852|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In642634852 |P2Thread1of1ForFork1_#t~ite35_Out642634852|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In642634852, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In642634852, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out642634852|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In642634852, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In642634852, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:03:19,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-419535407 |P2Thread1of1ForFork1_#t~ite36_Out-419535407|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-419535407|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-419535407|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:03:19,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1521275523 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1521275523 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1521275523 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1521275523| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1521275523| ~x$r_buff1_thd3~0_In1521275523)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1521275523, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1521275523|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1521275523, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:03:19,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, 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 19:03:19,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-624175564 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-624175564 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-624175564 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-624175564 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-624175564 256) 0) .cse0))) .cse1 (= ~x$w_buff1~0_In-624175564 |P0Thread1of1ForFork2_#t~ite11_Out-624175564|) (= |P0Thread1of1ForFork2_#t~ite12_Out-624175564| |P0Thread1of1ForFork2_#t~ite11_Out-624175564|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite11_In-624175564| |P0Thread1of1ForFork2_#t~ite11_Out-624175564|) (= |P0Thread1of1ForFork2_#t~ite12_Out-624175564| ~x$w_buff1~0_In-624175564)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-624175564, ~x$w_buff1~0=~x$w_buff1~0_In-624175564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624175564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-624175564, ~weak$$choice2~0=~weak$$choice2~0_In-624175564, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-624175564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-624175564} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-624175564, ~x$w_buff1~0=~x$w_buff1~0_In-624175564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624175564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-624175564, ~weak$$choice2~0=~weak$$choice2~0_In-624175564, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-624175564|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-624175564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-624175564} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:03:19,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In246690306 256)))) (or (and (= ~x$w_buff0_used~0_In246690306 |P0Thread1of1ForFork2_#t~ite15_Out246690306|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In246690306| |P0Thread1of1ForFork2_#t~ite14_Out246690306|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In246690306 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In246690306 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In246690306 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In246690306 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite14_Out246690306| ~x$w_buff0_used~0_In246690306) (= |P0Thread1of1ForFork2_#t~ite14_Out246690306| |P0Thread1of1ForFork2_#t~ite15_Out246690306|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In246690306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In246690306, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In246690306, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In246690306|, ~weak$$choice2~0=~weak$$choice2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In246690306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In246690306, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out246690306|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In246690306, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out246690306|, ~weak$$choice2~0=~weak$$choice2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:03:19,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} 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 19:03:19,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1121392408 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1121392408 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1121392408 256) 0) (and (= (mod ~x$w_buff1_used~0_In-1121392408 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1121392408 256))))) (= |P0Thread1of1ForFork2_#t~ite23_Out-1121392408| ~x$r_buff1_thd1~0_In-1121392408) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out-1121392408| |P0Thread1of1ForFork2_#t~ite23_Out-1121392408|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In-1121392408| |P0Thread1of1ForFork2_#t~ite23_Out-1121392408|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1121392408| ~x$r_buff1_thd1~0_In-1121392408)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1121392408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1121392408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1121392408, ~weak$$choice2~0=~weak$$choice2~0_In-1121392408, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1121392408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1121392408} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1121392408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1121392408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1121392408, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1121392408|, ~weak$$choice2~0=~weak$$choice2~0_In-1121392408, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1121392408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1121392408} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:03:19,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 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_5} 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_5, ~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 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1411863803 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1411863803| ~x$w_buff0_used~0_In-1411863803)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1411863803|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1411863803, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2132147236 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2132147236 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In2132147236 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2132147236 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2132147236| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out2132147236| ~x$w_buff1_used~0_In2132147236)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2132147236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2132147236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2132147236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2132147236, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2132147236, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2132147236, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2132147236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1897769408 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1897769408 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1897769408 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1897769408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1897769408|)) (and (= ~x$r_buff1_thd2~0_In-1897769408 |P1Thread1of1ForFork0_#t~ite31_Out-1897769408|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1897769408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1897769408|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1897769408, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, 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 19:03:19,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:03:19,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out262501188| |ULTIMATE.start_main_#t~ite41_Out262501188|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) .cse1 (not .cse2)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out262501188|, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:03:19,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-490519094| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-490519094| ~x$w_buff0_used~0_In-490519094) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-490519094|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:03:19,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-77900890 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-77900890 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-77900890 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-77900890 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-77900890|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-77900890| ~x$w_buff1_used~0_In-77900890)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-77900890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-77900890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-77900890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77900890} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-77900890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-77900890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-77900890, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-77900890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77900890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:03:19,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In922949385 |ULTIMATE.start_main_#t~ite45_Out922949385|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out922949385| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922949385, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out922949385|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:03:19,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-737869703 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-737869703 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-737869703 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-737869703 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-737869703| ~x$r_buff1_thd0~0_In-737869703) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-737869703| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-737869703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-737869703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-737869703, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-737869703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-737869703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:03:19,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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 19:03:19,174 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_72515bba-3b93-4224-9084-23746569f90b/bin/uautomizer/witness.graphml [2019-12-07 19:03:19,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:03:19,175 INFO L168 Benchmark]: Toolchain (without parser) took 80300.09 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 934.0 MB in the beginning and 5.7 GB in the end (delta: -4.8 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:03:19,175 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:03:19,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:19,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.36 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 19:03:19,176 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 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 19:03:19,176 INFO L168 Benchmark]: RCFGBuilder took 383.93 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:19,176 INFO L168 Benchmark]: TraceAbstraction took 79366.55 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:03:19,177 INFO L168 Benchmark]: Witness Printer took 79.79 ms. Allocated memory was 6.3 GB in the beginning and 6.4 GB in the end (delta: 131.1 MB). Free memory was 3.4 GB in the beginning and 5.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 49.2 kB. Max. memory is 11.5 GB. [2019-12-07 19:03:19,178 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.36 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.85 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 383.93 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79366.55 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 79.79 ms. Allocated memory was 6.3 GB in the beginning and 6.4 GB in the end (delta: 131.1 MB). Free memory was 3.4 GB in the beginning and 5.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 49.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 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(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, z=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 [L820] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, z=1] [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, 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, z=1] [L728] 1 z = 2 [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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=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) [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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [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 [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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, z=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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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, z=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_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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, z=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) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [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 [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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3022 SDtfs, 2861 SDslu, 5110 SDs, 0 SdLazy, 2739 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250613occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 162303 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 91007 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...