./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a70e32b4ce75a79b59859cdb01db9ebf0636f8c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:19:07,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:19:07,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:19:07,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:19:07,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:19:07,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:19:07,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:19:07,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:19:07,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:19:07,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:19:07,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:19:07,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:19:07,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:19:07,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:19:07,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:19:07,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:19:07,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:19:07,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:19:07,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:19:07,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:19:07,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:19:07,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:19:07,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:19:07,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:19:07,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:19:07,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:19:07,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:19:07,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:19:07,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:19:07,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:19:07,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:19:07,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:19:07,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:19:07,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:19:07,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:19:07,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:19:07,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:19:07,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:19:07,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:19:07,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:19:07,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:19:07,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:19:07,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:19:07,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:19:07,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:19:07,826 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:19:07,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:19:07,827 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:19:07,828 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:19:07,828 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:19:07,828 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:19:07,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:19:07,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:19:07,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:19:07,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:19:07,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:19:07,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:19:07,831 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan 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 -> Taipan 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 -> 4a70e32b4ce75a79b59859cdb01db9ebf0636f8c [2019-12-07 14:19:07,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:19:07,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:19:07,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:19:07,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:19:07,944 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:19:07,944 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i [2019-12-07 14:19:07,982 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/data/c6471347e/1d0f64d87a604a60b74e1c0979cd7901/FLAG06a3b9c60 [2019-12-07 14:19:08,407 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:19:08,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/sv-benchmarks/c/pthread-wmm/mix051_tso.opt.i [2019-12-07 14:19:08,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/data/c6471347e/1d0f64d87a604a60b74e1c0979cd7901/FLAG06a3b9c60 [2019-12-07 14:19:08,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/data/c6471347e/1d0f64d87a604a60b74e1c0979cd7901 [2019-12-07 14:19:08,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:19:08,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:19:08,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:19:08,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:19:08,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:19:08,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:19:08" (1/1) ... [2019-12-07 14:19:08,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:08, skipping insertion in model container [2019-12-07 14:19:08,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:19:08" (1/1) ... [2019-12-07 14:19:08,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:19:08,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:19:09,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:19:09,098 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:19:09,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:19:09,207 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:19:09,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09 WrapperNode [2019-12-07 14:19:09,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:19:09,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:19:09,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:19:09,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:19:09,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:19:09,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:19:09,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:19:09,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:19:09,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... [2019-12-07 14:19:09,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:19:09,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:19:09,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:19:09,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:19:09,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:19:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:19:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:19:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:19:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:19:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:19:09,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:19:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:19:09,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:19:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:19:09,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:19:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 14:19:09,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 14:19:09,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:19:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:19:09,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:19:09,325 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:19:09,658 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:19:09,658 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:19:09,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:19:09 BoogieIcfgContainer [2019-12-07 14:19:09,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:19:09,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:19:09,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:19:09,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:19:09,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:19:08" (1/3) ... [2019-12-07 14:19:09,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102acb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:19:09, skipping insertion in model container [2019-12-07 14:19:09,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:19:09" (2/3) ... [2019-12-07 14:19:09,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102acb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:19:09, skipping insertion in model container [2019-12-07 14:19:09,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:19:09" (3/3) ... [2019-12-07 14:19:09,664 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_tso.opt.i [2019-12-07 14:19:09,670 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:19:09,670 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:19:09,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:19:09,675 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,699 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:19:09,726 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 14:19:09,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:19:09,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:19:09,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:19:09,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:19:09,739 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:19:09,739 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:19:09,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:19:09,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:19:09,750 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-07 14:19:09,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-07 14:19:09,802 INFO L134 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-07 14:19:09,802 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:19:09,811 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 569 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 14:19:09,823 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-07 14:19:09,850 INFO L134 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-07 14:19:09,851 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:19:09,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 569 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 14:19:09,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 14:19:09,867 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:19:12,735 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 14:19:12,925 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 14:19:13,030 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-07 14:19:13,030 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-07 14:19:13,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-07 14:19:14,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-07 14:19:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-07 14:19:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:19:14,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:14,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:14,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-07 14:19:14,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:14,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58882002] [2019-12-07 14:19:14,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:14,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58882002] [2019-12-07 14:19:14,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:14,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:19:14,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431994800] [2019-12-07 14:19:14,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:14,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:14,457 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-07 14:19:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:14,781 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-07 14:19:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:14,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:19:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:14,964 INFO L225 Difference]: With dead ends: 23966 [2019-12-07 14:19:14,965 INFO L226 Difference]: Without dead ends: 22574 [2019-12-07 14:19:14,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-07 14:19:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-07 14:19:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-07 14:19:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-07 14:19:15,690 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-07 14:19:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:15,691 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-07 14:19:15,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-07 14:19:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:19:15,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:15,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:15,697 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-07 14:19:15,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:15,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141393587] [2019-12-07 14:19:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:15,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141393587] [2019-12-07 14:19:15,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:15,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:15,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056399704] [2019-12-07 14:19:15,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:15,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:15,768 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-07 14:19:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:16,081 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-07 14:19:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:19:16,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 14:19:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:16,259 INFO L225 Difference]: With dead ends: 34006 [2019-12-07 14:19:16,260 INFO L226 Difference]: Without dead ends: 33954 [2019-12-07 14:19:16,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-07 14:19:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-07 14:19:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-07 14:19:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-07 14:19:17,062 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-07 14:19:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:17,062 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-07 14:19:17,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-07 14:19:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:19:17,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:17,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:17,068 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-07 14:19:17,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:17,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423459600] [2019-12-07 14:19:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:17,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423459600] [2019-12-07 14:19:17,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:17,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:17,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034626479] [2019-12-07 14:19:17,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:17,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:17,100 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 3 states. [2019-12-07 14:19:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:17,279 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-07 14:19:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:17,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:19:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:17,366 INFO L225 Difference]: With dead ends: 39490 [2019-12-07 14:19:17,366 INFO L226 Difference]: Without dead ends: 39490 [2019-12-07 14:19:17,367 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 14:19:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-07 14:19:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-07 14:19:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-07 14:19:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-07 14:19:18,186 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-07 14:19:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:18,187 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-07 14:19:18,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-07 14:19:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:19:18,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:18,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:18,193 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-07 14:19:18,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:18,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515533403] [2019-12-07 14:19:18,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:18,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515533403] [2019-12-07 14:19:18,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:18,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:18,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834423860] [2019-12-07 14:19:18,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:18,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:18,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:18,251 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 4 states. [2019-12-07 14:19:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:18,654 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-07 14:19:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:19:18,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:19:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:18,744 INFO L225 Difference]: With dead ends: 39306 [2019-12-07 14:19:18,744 INFO L226 Difference]: Without dead ends: 39270 [2019-12-07 14:19:18,744 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 14:19:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-07 14:19:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-07 14:19:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-07 14:19:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-07 14:19:19,462 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-07 14:19:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:19,462 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-07 14:19:19,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-07 14:19:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:19:19,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:19,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:19,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-07 14:19:19,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:19,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164831493] [2019-12-07 14:19:19,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:19,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164831493] [2019-12-07 14:19:19,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:19,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:19,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787560149] [2019-12-07 14:19:19,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:19,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:19,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:19,523 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 4 states. [2019-12-07 14:19:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:19,881 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-07 14:19:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:19:19,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:19:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:19,975 INFO L225 Difference]: With dead ends: 43030 [2019-12-07 14:19:19,976 INFO L226 Difference]: Without dead ends: 42978 [2019-12-07 14:19:19,976 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 14:19:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-07 14:19:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-07 14:19:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-07 14:19:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-07 14:19:20,743 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-07 14:19:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:20,743 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-07 14:19:20,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-07 14:19:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:19:20,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:20,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:20,753 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-07 14:19:20,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:20,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957710355] [2019-12-07 14:19:20,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:20,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957710355] [2019-12-07 14:19:20,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:20,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:20,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745764890] [2019-12-07 14:19:20,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:20,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:20,815 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 4 states. [2019-12-07 14:19:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:20,953 INFO L93 Difference]: Finished difference Result 30593 states and 119559 transitions. [2019-12-07 14:19:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:20,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 14:19:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:21,011 INFO L225 Difference]: With dead ends: 30593 [2019-12-07 14:19:21,011 INFO L226 Difference]: Without dead ends: 28181 [2019-12-07 14:19:21,011 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 14:19:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28181 states. [2019-12-07 14:19:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28181 to 28181. [2019-12-07 14:19:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28181 states. [2019-12-07 14:19:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28181 states to 28181 states and 111222 transitions. [2019-12-07 14:19:21,592 INFO L78 Accepts]: Start accepts. Automaton has 28181 states and 111222 transitions. Word has length 20 [2019-12-07 14:19:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:21,592 INFO L462 AbstractCegarLoop]: Abstraction has 28181 states and 111222 transitions. [2019-12-07 14:19:21,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 28181 states and 111222 transitions. [2019-12-07 14:19:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:19:21,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:21,598 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] [2019-12-07 14:19:21,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-07 14:19:21,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:21,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967230381] [2019-12-07 14:19:21,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:21,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967230381] [2019-12-07 14:19:21,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:21,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:21,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304728504] [2019-12-07 14:19:21,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:21,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:21,648 INFO L87 Difference]: Start difference. First operand 28181 states and 111222 transitions. Second operand 3 states. [2019-12-07 14:19:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:21,803 INFO L93 Difference]: Finished difference Result 42819 states and 164082 transitions. [2019-12-07 14:19:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:21,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 14:19:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:21,886 INFO L225 Difference]: With dead ends: 42819 [2019-12-07 14:19:21,886 INFO L226 Difference]: Without dead ends: 42107 [2019-12-07 14:19:21,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42107 states. [2019-12-07 14:19:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42107 to 41295. [2019-12-07 14:19:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41295 states. [2019-12-07 14:19:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41295 states to 41295 states and 159409 transitions. [2019-12-07 14:19:22,730 INFO L78 Accepts]: Start accepts. Automaton has 41295 states and 159409 transitions. Word has length 21 [2019-12-07 14:19:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:22,731 INFO L462 AbstractCegarLoop]: Abstraction has 41295 states and 159409 transitions. [2019-12-07 14:19:22,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 41295 states and 159409 transitions. [2019-12-07 14:19:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:19:22,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:22,740 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] [2019-12-07 14:19:22,740 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-07 14:19:22,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:22,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169245437] [2019-12-07 14:19:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:22,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169245437] [2019-12-07 14:19:22,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:22,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:19:22,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569371917] [2019-12-07 14:19:22,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:19:22,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:19:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:22,785 INFO L87 Difference]: Start difference. First operand 41295 states and 159409 transitions. Second operand 5 states. [2019-12-07 14:19:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:22,887 INFO L93 Difference]: Finished difference Result 23185 states and 77162 transitions. [2019-12-07 14:19:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:19:22,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 14:19:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:22,915 INFO L225 Difference]: With dead ends: 23185 [2019-12-07 14:19:22,915 INFO L226 Difference]: Without dead ends: 20227 [2019-12-07 14:19:22,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20227 states. [2019-12-07 14:19:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20227 to 20227. [2019-12-07 14:19:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20227 states. [2019-12-07 14:19:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20227 states to 20227 states and 67176 transitions. [2019-12-07 14:19:23,203 INFO L78 Accepts]: Start accepts. Automaton has 20227 states and 67176 transitions. Word has length 21 [2019-12-07 14:19:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,204 INFO L462 AbstractCegarLoop]: Abstraction has 20227 states and 67176 transitions. [2019-12-07 14:19:23,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:19:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20227 states and 67176 transitions. [2019-12-07 14:19:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:19:23,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:23,209 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-07 14:19:23,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:23,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755191615] [2019-12-07 14:19:23,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:23,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755191615] [2019-12-07 14:19:23,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:23,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:19:23,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310201261] [2019-12-07 14:19:23,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:23,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:23,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:23,257 INFO L87 Difference]: Start difference. First operand 20227 states and 67176 transitions. Second operand 6 states. [2019-12-07 14:19:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:23,329 INFO L93 Difference]: Finished difference Result 6576 states and 19503 transitions. [2019-12-07 14:19:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:23,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:19:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:23,335 INFO L225 Difference]: With dead ends: 6576 [2019-12-07 14:19:23,335 INFO L226 Difference]: Without dead ends: 5172 [2019-12-07 14:19:23,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:19:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-12-07 14:19:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4585. [2019-12-07 14:19:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4585 states. [2019-12-07 14:19:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 13281 transitions. [2019-12-07 14:19:23,393 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 13281 transitions. Word has length 22 [2019-12-07 14:19:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,394 INFO L462 AbstractCegarLoop]: Abstraction has 4585 states and 13281 transitions. [2019-12-07 14:19:23,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 13281 transitions. [2019-12-07 14:19:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:19:23,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,399 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 14:19:23,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-07 14:19:23,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:23,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155964983] [2019-12-07 14:19:23,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:23,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155964983] [2019-12-07 14:19:23,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:23,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:23,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435176694] [2019-12-07 14:19:23,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:19:23,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:23,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:19:23,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:23,469 INFO L87 Difference]: Start difference. First operand 4585 states and 13281 transitions. Second operand 5 states. [2019-12-07 14:19:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:23,628 INFO L93 Difference]: Finished difference Result 5713 states and 16111 transitions. [2019-12-07 14:19:23,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:19:23,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 14:19:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:23,634 INFO L225 Difference]: With dead ends: 5713 [2019-12-07 14:19:23,634 INFO L226 Difference]: Without dead ends: 5711 [2019-12-07 14:19:23,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-07 14:19:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4866. [2019-12-07 14:19:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4866 states. [2019-12-07 14:19:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 14046 transitions. [2019-12-07 14:19:23,689 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 14046 transitions. Word has length 31 [2019-12-07 14:19:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,689 INFO L462 AbstractCegarLoop]: Abstraction has 4866 states and 14046 transitions. [2019-12-07 14:19:23,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:19:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 14046 transitions. [2019-12-07 14:19:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:19:23,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,694 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 14:19:23,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1138439690, now seen corresponding path program 1 times [2019-12-07 14:19:23,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:23,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171868913] [2019-12-07 14:19:23,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:23,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 14:19:23,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171868913] [2019-12-07 14:19:23,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:23,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:23,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042579446] [2019-12-07 14:19:23,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:23,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:23,719 INFO L87 Difference]: Start difference. First operand 4866 states and 14046 transitions. Second operand 3 states. [2019-12-07 14:19:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:23,760 INFO L93 Difference]: Finished difference Result 5854 states and 16116 transitions. [2019-12-07 14:19:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:23,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 14:19:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:23,768 INFO L225 Difference]: With dead ends: 5854 [2019-12-07 14:19:23,768 INFO L226 Difference]: Without dead ends: 5854 [2019-12-07 14:19:23,768 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 14:19:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-07 14:19:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4824. [2019-12-07 14:19:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-12-07 14:19:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 13370 transitions. [2019-12-07 14:19:23,826 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 13370 transitions. Word has length 31 [2019-12-07 14:19:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,827 INFO L462 AbstractCegarLoop]: Abstraction has 4824 states and 13370 transitions. [2019-12-07 14:19:23,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 13370 transitions. [2019-12-07 14:19:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 14:19:23,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,832 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] [2019-12-07 14:19:23,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash -402711057, now seen corresponding path program 1 times [2019-12-07 14:19:23,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:23,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561987929] [2019-12-07 14:19:23,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:23,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561987929] [2019-12-07 14:19:23,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:23,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:23,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941157484] [2019-12-07 14:19:23,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:23,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:23,879 INFO L87 Difference]: Start difference. First operand 4824 states and 13370 transitions. Second operand 3 states. [2019-12-07 14:19:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:23,898 INFO L93 Difference]: Finished difference Result 4724 states and 13045 transitions. [2019-12-07 14:19:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:23,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 14:19:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:23,903 INFO L225 Difference]: With dead ends: 4724 [2019-12-07 14:19:23,903 INFO L226 Difference]: Without dead ends: 4724 [2019-12-07 14:19:23,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2019-12-07 14:19:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4148. [2019-12-07 14:19:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-12-07 14:19:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 11456 transitions. [2019-12-07 14:19:23,947 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 11456 transitions. Word has length 32 [2019-12-07 14:19:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,948 INFO L462 AbstractCegarLoop]: Abstraction has 4148 states and 11456 transitions. [2019-12-07 14:19:23,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 11456 transitions. [2019-12-07 14:19:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:19:23,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:23,952 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1471954053, now seen corresponding path program 1 times [2019-12-07 14:19:23,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:23,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811292289] [2019-12-07 14:19:23,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:24,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811292289] [2019-12-07 14:19:24,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:19:24,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426562356] [2019-12-07 14:19:24,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:19:24,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:24,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:19:24,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:24,012 INFO L87 Difference]: Start difference. First operand 4148 states and 11456 transitions. Second operand 7 states. [2019-12-07 14:19:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,082 INFO L93 Difference]: Finished difference Result 2901 states and 8526 transitions. [2019-12-07 14:19:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:19:24,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 14:19:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,085 INFO L225 Difference]: With dead ends: 2901 [2019-12-07 14:19:24,085 INFO L226 Difference]: Without dead ends: 2733 [2019-12-07 14:19:24,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:19:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2019-12-07 14:19:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2178. [2019-12-07 14:19:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2019-12-07 14:19:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 6752 transitions. [2019-12-07 14:19:24,109 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 6752 transitions. Word has length 33 [2019-12-07 14:19:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,110 INFO L462 AbstractCegarLoop]: Abstraction has 2178 states and 6752 transitions. [2019-12-07 14:19:24,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:19:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 6752 transitions. [2019-12-07 14:19:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:19:24,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:24,113 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 652637235, now seen corresponding path program 1 times [2019-12-07 14:19:24,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:24,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430995446] [2019-12-07 14:19:24,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:24,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430995446] [2019-12-07 14:19:24,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:19:24,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639758020] [2019-12-07 14:19:24,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:19:24,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:19:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:24,169 INFO L87 Difference]: Start difference. First operand 2178 states and 6752 transitions. Second operand 5 states. [2019-12-07 14:19:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,207 INFO L93 Difference]: Finished difference Result 3605 states and 10314 transitions. [2019-12-07 14:19:24,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:24,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 14:19:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,209 INFO L225 Difference]: With dead ends: 3605 [2019-12-07 14:19:24,210 INFO L226 Difference]: Without dead ends: 2312 [2019-12-07 14:19:24,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-12-07 14:19:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1894. [2019-12-07 14:19:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-12-07 14:19:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 5758 transitions. [2019-12-07 14:19:24,231 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 5758 transitions. Word has length 47 [2019-12-07 14:19:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,232 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 5758 transitions. [2019-12-07 14:19:24,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:19:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 5758 transitions. [2019-12-07 14:19:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:19:24,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,234 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] [2019-12-07 14:19:24,234 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash -333210519, now seen corresponding path program 2 times [2019-12-07 14:19:24,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:24,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665038252] [2019-12-07 14:19:24,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:24,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665038252] [2019-12-07 14:19:24,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:24,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283050457] [2019-12-07 14:19:24,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:24,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:24,286 INFO L87 Difference]: Start difference. First operand 1894 states and 5758 transitions. Second operand 4 states. [2019-12-07 14:19:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,304 INFO L93 Difference]: Finished difference Result 2334 states and 6702 transitions. [2019-12-07 14:19:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:24,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 14:19:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,306 INFO L225 Difference]: With dead ends: 2334 [2019-12-07 14:19:24,307 INFO L226 Difference]: Without dead ends: 1413 [2019-12-07 14:19:24,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-07 14:19:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2019-12-07 14:19:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-07 14:19:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 3879 transitions. [2019-12-07 14:19:24,326 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 3879 transitions. Word has length 47 [2019-12-07 14:19:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,326 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 3879 transitions. [2019-12-07 14:19:24,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 3879 transitions. [2019-12-07 14:19:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:19:24,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,328 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] [2019-12-07 14:19:24,328 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash 639928323, now seen corresponding path program 3 times [2019-12-07 14:19:24,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:24,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481234264] [2019-12-07 14:19:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:24,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481234264] [2019-12-07 14:19:24,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:24,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422435979] [2019-12-07 14:19:24,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:24,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:24,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:24,363 INFO L87 Difference]: Start difference. First operand 1413 states and 3879 transitions. Second operand 4 states. [2019-12-07 14:19:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,380 INFO L93 Difference]: Finished difference Result 1787 states and 4693 transitions. [2019-12-07 14:19:24,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:24,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 14:19:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,382 INFO L225 Difference]: With dead ends: 1787 [2019-12-07 14:19:24,382 INFO L226 Difference]: Without dead ends: 419 [2019-12-07 14:19:24,382 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 14:19:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-07 14:19:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-07 14:19:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 14:19:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 893 transitions. [2019-12-07 14:19:24,387 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 893 transitions. Word has length 47 [2019-12-07 14:19:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,387 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 893 transitions. [2019-12-07 14:19:24,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 893 transitions. [2019-12-07 14:19:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:19:24,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,388 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] [2019-12-07 14:19:24,388 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1882928771, now seen corresponding path program 4 times [2019-12-07 14:19:24,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:24,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692419525] [2019-12-07 14:19:24,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:24,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692419525] [2019-12-07 14:19:24,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:19:24,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205183454] [2019-12-07 14:19:24,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:19:24,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:19:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:19:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:24,460 INFO L87 Difference]: Start difference. First operand 419 states and 893 transitions. Second operand 7 states. [2019-12-07 14:19:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,629 INFO L93 Difference]: Finished difference Result 802 states and 1670 transitions. [2019-12-07 14:19:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:19:24,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 14:19:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,630 INFO L225 Difference]: With dead ends: 802 [2019-12-07 14:19:24,630 INFO L226 Difference]: Without dead ends: 540 [2019-12-07 14:19:24,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:19:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-07 14:19:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 482. [2019-12-07 14:19:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-07 14:19:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 997 transitions. [2019-12-07 14:19:24,636 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 997 transitions. Word has length 47 [2019-12-07 14:19:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 997 transitions. [2019-12-07 14:19:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:19:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 997 transitions. [2019-12-07 14:19:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 14:19:24,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,637 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] [2019-12-07 14:19:24,637 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 5 times [2019-12-07 14:19:24,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:19:24,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499312626] [2019-12-07 14:19:24,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:19:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:19:24,702 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:19:24,702 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:19:24,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36|)) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 |v_ULTIMATE.start_main_~#t1381~0.offset_23|) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36|) |v_ULTIMATE.start_main_~#t1381~0.offset_23| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1381~0.base_36|) (= |v_#NULL.offset_5| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1381~0.base_36| 4)) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ULTIMATE.start_main_~#t1381~0.base=|v_ULTIMATE.start_main_~#t1381~0.base_36|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_17|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_24|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_37|, ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t1381~0.offset=|v_ULTIMATE.start_main_~#t1381~0.offset_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1381~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1384~0.base, #length, ULTIMATE.start_main_~#t1382~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1382~0.base, ULTIMATE.start_main_~#t1384~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1383~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1383~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1381~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:19:24,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11| 1) |v_#valid_43|) (= 0 |v_ULTIMATE.start_main_~#t1382~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1382~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1382~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) |v_ULTIMATE.start_main_~#t1382~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1382~0.offset, #length, ULTIMATE.start_main_~#t1382~0.base] because there is no mapped edge [2019-12-07 14:19:24,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1383~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11|) |v_ULTIMATE.start_main_~#t1383~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1383~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1383~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11| 1) |v_#valid_41|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1383~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1383~0.offset] because there is no mapped edge [2019-12-07 14:19:24,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1384~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13|) |v_ULTIMATE.start_main_~#t1384~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1384~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1384~0.base_13| 4) |v_#length_23|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1384~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1384~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1384~0.base, #length] because there is no mapped edge [2019-12-07 14:19:24,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20)) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:19:24,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~a~0_44 1) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_51 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_23|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 14:19:24,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~x~0_33 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_15)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:19:24,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-164942991 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-164942991 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-164942991| ~z$w_buff0_used~0_In-164942991) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out-164942991| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-164942991, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-164942991} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-164942991, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-164942991|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-164942991} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:19:24,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In542598042 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In542598042 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In542598042 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In542598042 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out542598042| 0)) (and (= ~z$w_buff1_used~0_In542598042 |P3Thread1of1ForFork1_#t~ite29_Out542598042|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In542598042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542598042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In542598042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542598042} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In542598042, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out542598042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542598042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In542598042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542598042} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:19:24,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1271466478 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1271466478 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1271466478 ~z$r_buff0_thd4~0_In-1271466478))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1271466478 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271466478, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1271466478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271466478, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1271466478, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1271466478|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:19:24,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In67515035 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In67515035 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In67515035 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In67515035 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out67515035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out67515035| ~z$r_buff1_thd4~0_In67515035)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In67515035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In67515035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In67515035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In67515035} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In67515035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In67515035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In67515035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In67515035, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out67515035|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:19:24,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite31_60| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:19:24,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite23_31| |v_P2Thread1of1ForFork0_#t~ite23_30|) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_44|) (= |v_P2Thread1of1ForFork0_#t~ite22_29| |v_P2Thread1of1ForFork0_#t~ite22_28|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0))) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_29|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_13|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_28|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_30|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_44|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_29|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_27|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:19:24,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:19:24,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:19:24,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1431836944 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1431836944 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1431836944| ~z~0_In-1431836944)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1431836944| ~z$w_buff1~0_In-1431836944) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431836944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431836944, ~z$w_buff1~0=~z$w_buff1~0_In-1431836944, ~z~0=~z~0_In-1431836944} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431836944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431836944, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1431836944|, ~z$w_buff1~0=~z$w_buff1~0_In-1431836944, ~z~0=~z~0_In-1431836944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:19:24,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 14:19:24,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1323070378 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1323070378 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1323070378| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1323070378 |ULTIMATE.start_main_#t~ite38_Out-1323070378|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323070378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323070378} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323070378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323070378, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1323070378|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:19:24,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1010276006 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1010276006 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1010276006 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1010276006 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1010276006|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1010276006 |ULTIMATE.start_main_#t~ite39_Out1010276006|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010276006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010276006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1010276006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1010276006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010276006, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1010276006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010276006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1010276006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1010276006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:19:24,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In269876670 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In269876670 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out269876670| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out269876670| ~z$r_buff0_thd0~0_In269876670)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269876670, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269876670} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269876670, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out269876670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269876670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:19:24,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In388190703 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In388190703 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In388190703 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In388190703 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out388190703| ~z$r_buff1_thd0~0_In388190703) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite41_Out388190703| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388190703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388190703, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388190703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388190703} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out388190703|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388190703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388190703, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388190703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388190703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:19:24,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:24,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:19:24 BasicIcfg [2019-12-07 14:19:24,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:19:24,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:19:24,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:19:24,767 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:19:24,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:19:09" (3/4) ... [2019-12-07 14:19:24,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:19:24,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36|)) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 |v_ULTIMATE.start_main_~#t1381~0.offset_23|) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36|) |v_ULTIMATE.start_main_~#t1381~0.offset_23| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1381~0.base_36|) (= |v_#NULL.offset_5| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1381~0.base_36| 4)) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ULTIMATE.start_main_~#t1381~0.base=|v_ULTIMATE.start_main_~#t1381~0.base_36|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_17|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_24|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_37|, ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t1381~0.offset=|v_ULTIMATE.start_main_~#t1381~0.offset_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1381~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1384~0.base, #length, ULTIMATE.start_main_~#t1382~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1382~0.base, ULTIMATE.start_main_~#t1384~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1383~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1383~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1381~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:19:24,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11| 1) |v_#valid_43|) (= 0 |v_ULTIMATE.start_main_~#t1382~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1382~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1382~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) |v_ULTIMATE.start_main_~#t1382~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1382~0.offset, #length, ULTIMATE.start_main_~#t1382~0.base] because there is no mapped edge [2019-12-07 14:19:24,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1383~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11|) |v_ULTIMATE.start_main_~#t1383~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1383~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1383~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11| 1) |v_#valid_41|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1383~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1383~0.offset] because there is no mapped edge [2019-12-07 14:19:24,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1384~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13|) |v_ULTIMATE.start_main_~#t1384~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1384~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1384~0.base_13| 4) |v_#length_23|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1384~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1384~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1384~0.base, #length] because there is no mapped edge [2019-12-07 14:19:24,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20)) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:19:24,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~a~0_44 1) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_51 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_23|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 14:19:24,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~x~0_33 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_15)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:19:24,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-164942991 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-164942991 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-164942991| ~z$w_buff0_used~0_In-164942991) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out-164942991| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-164942991, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-164942991} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-164942991, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-164942991|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-164942991} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:19:24,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In542598042 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In542598042 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In542598042 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In542598042 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out542598042| 0)) (and (= ~z$w_buff1_used~0_In542598042 |P3Thread1of1ForFork1_#t~ite29_Out542598042|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In542598042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542598042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In542598042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542598042} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In542598042, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out542598042|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542598042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In542598042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In542598042} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:19:24,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1271466478 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1271466478 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1271466478 ~z$r_buff0_thd4~0_In-1271466478))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1271466478 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271466478, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1271466478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1271466478, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1271466478, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1271466478|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:19:24,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In67515035 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In67515035 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In67515035 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In67515035 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out67515035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out67515035| ~z$r_buff1_thd4~0_In67515035)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In67515035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In67515035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In67515035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In67515035} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In67515035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In67515035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In67515035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In67515035, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out67515035|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:19:24,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite31_60| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:19:24,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite23_31| |v_P2Thread1of1ForFork0_#t~ite23_30|) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_44|) (= |v_P2Thread1of1ForFork0_#t~ite22_29| |v_P2Thread1of1ForFork0_#t~ite22_28|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0))) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_29|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_13|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_28|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_30|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_44|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_29|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_27|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:19:24,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:19:24,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:19:24,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1431836944 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1431836944 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1431836944| ~z~0_In-1431836944)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1431836944| ~z$w_buff1~0_In-1431836944) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431836944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431836944, ~z$w_buff1~0=~z$w_buff1~0_In-1431836944, ~z~0=~z~0_In-1431836944} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431836944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431836944, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1431836944|, ~z$w_buff1~0=~z$w_buff1~0_In-1431836944, ~z~0=~z~0_In-1431836944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:19:24,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 14:19:24,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1323070378 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1323070378 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1323070378| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1323070378 |ULTIMATE.start_main_#t~ite38_Out-1323070378|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323070378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323070378} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1323070378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323070378, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1323070378|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:19:24,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1010276006 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1010276006 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1010276006 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1010276006 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1010276006|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1010276006 |ULTIMATE.start_main_#t~ite39_Out1010276006|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010276006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010276006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1010276006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1010276006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010276006, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1010276006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010276006, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1010276006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1010276006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:19:24,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In269876670 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In269876670 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out269876670| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out269876670| ~z$r_buff0_thd0~0_In269876670)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269876670, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269876670} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269876670, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out269876670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269876670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:19:24,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In388190703 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In388190703 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In388190703 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In388190703 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out388190703| ~z$r_buff1_thd0~0_In388190703) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite41_Out388190703| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388190703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388190703, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388190703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388190703} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out388190703|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388190703, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388190703, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388190703, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388190703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:19:24,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:24,829 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c9ab5ba4-eeab-422a-af2f-388c281f5726/bin/utaipan/witness.graphml [2019-12-07 14:19:24,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:19:24,830 INFO L168 Benchmark]: Toolchain (without parser) took 16064.33 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 943.5 MB in the beginning and 554.0 MB in the end (delta: 389.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,830 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:19:24,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,831 INFO L168 Benchmark]: Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:19:24,831 INFO L168 Benchmark]: RCFGBuilder took 378.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,831 INFO L168 Benchmark]: TraceAbstraction took 15106.20 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 562.5 MB in the end (delta: 468.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,832 INFO L168 Benchmark]: Witness Printer took 62.46 ms. Allocated memory is still 2.5 GB. Free memory was 562.5 MB in the beginning and 554.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:24,833 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 378.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15106.20 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 562.5 MB in the end (delta: 468.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 62.46 ms. Allocated memory is still 2.5 GB. Free memory was 562.5 MB in the beginning and 554.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1384, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1814 SDtfs, 2606 SDslu, 2910 SDs, 0 SdLazy, 796 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 27857 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 84892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...