./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/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 0cc07a8a3a84ee2d94eaa17860f3ad074a8e0360 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41:23,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:41:23,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:41:23,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:41:23,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:41:23,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:41:23,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:41:23,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:41:23,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:41:23,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:41:23,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:41:23,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:41:23,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:41:23,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:41:23,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:41:23,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:41:23,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:41:23,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:41:23,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:41:23,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:41:23,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:41:23,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:41:23,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:41:23,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:41:23,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:41:23,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:41:23,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:41:23,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:41:23,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:41:23,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:41:23,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:41:23,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:41:23,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:41:23,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:41:23,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:41:23,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:41:23,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:41:23,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:41:23,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:41:23,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:41:23,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:41:23,809 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:41:23,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:41:23,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:41:23,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:41:23,820 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:41:23,820 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:41:23,820 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:41:23,820 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:41:23,820 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:41:23,821 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:41:23,821 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:41:23,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:41:23,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:41:23,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:41:23,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:41:23,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:41:23,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:41:23,824 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_8ffe5875-6da1-411b-a36e-dc5beef53d01/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 -> 0cc07a8a3a84ee2d94eaa17860f3ad074a8e0360 [2019-12-07 14:41:23,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:41:23,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:41:23,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:41:23,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:41:23,937 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:41:23,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe005_pso.oepc.i [2019-12-07 14:41:23,980 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/data/e9b0ea110/75611ab85fd44b9ba426ed4a01603a46/FLAG148992da6 [2019-12-07 14:41:24,344 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:41:24,344 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/sv-benchmarks/c/pthread-wmm/safe005_pso.oepc.i [2019-12-07 14:41:24,354 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/data/e9b0ea110/75611ab85fd44b9ba426ed4a01603a46/FLAG148992da6 [2019-12-07 14:41:24,363 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/data/e9b0ea110/75611ab85fd44b9ba426ed4a01603a46 [2019-12-07 14:41:24,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:41:24,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:41:24,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:24,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:41:24,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:41:24,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24, skipping insertion in model container [2019-12-07 14:41:24,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:41:24,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:41:24,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:24,663 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:41:24,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:24,750 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:41:24,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24 WrapperNode [2019-12-07 14:41:24,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:24,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:24,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:41:24,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:41:24,756 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:41:24" (1/1) ... [2019-12-07 14:41:24,769 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:41:24" (1/1) ... [2019-12-07 14:41:24,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:24,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:41:24,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:41:24,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:41:24,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... [2019-12-07 14:41:24,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:41:24,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:41:24,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:41:24,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:41:24,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/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:41:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:41:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:41:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:41:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:41:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:41:24,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:41:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:41:24,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:41:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:41:24,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:41:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:41:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:41:24,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:41:24,852 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:41:25,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:41:25,192 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:41:25,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:25 BoogieIcfgContainer [2019-12-07 14:41:25,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:41:25,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:41:25,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:41:25,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:41:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:41:24" (1/3) ... [2019-12-07 14:41:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6449f6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:25, skipping insertion in model container [2019-12-07 14:41:25,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:24" (2/3) ... [2019-12-07 14:41:25,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6449f6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:25, skipping insertion in model container [2019-12-07 14:41:25,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:25" (3/3) ... [2019-12-07 14:41:25,199 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.oepc.i [2019-12-07 14:41:25,208 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:41:25,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:41:25,214 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:41:25,215 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:41:25,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:25,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:41:25,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:41:25,293 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:41:25,294 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:41:25,294 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:41:25,294 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:41:25,294 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:41:25,294 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:41:25,294 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:41:25,305 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 14:41:25,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 14:41:25,357 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 14:41:25,357 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:41:25,367 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:41:25,381 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 14:41:25,409 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 14:41:25,409 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:41:25,414 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:41:25,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 14:41:25,430 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:41:28,413 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 14:41:28,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-07 14:41:28,553 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 14:41:28,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 14:41:37,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 14:41:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 14:41:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:41:37,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:37,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:41:37,965 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-07 14:41:37,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:41:37,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792660897] [2019-12-07 14:41:37,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:38,110 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:41:38,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792660897] [2019-12-07 14:41:38,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:41:38,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250075484] [2019-12-07 14:41:38,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:38,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:41:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:38,127 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 14:41:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:38,832 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 14:41:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:38,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:41:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:39,224 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 14:41:39,225 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 14:41:39,226 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:41:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 14:41:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 14:41:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 14:41:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 14:41:43,605 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 14:41:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:43,605 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 14:41:43,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 14:41:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:41:43,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:43,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:43,613 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-07 14:41:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:41:43,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667650795] [2019-12-07 14:41:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:43,681 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:41:43,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667650795] [2019-12-07 14:41:43,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:43,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:41:43,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535193141] [2019-12-07 14:41:43,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:41:43,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:41:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:41:43,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:41:43,684 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 14:41:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:45,681 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 14:41:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:41:45,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:41:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:46,029 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 14:41:46,029 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 14:41:46,030 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:41:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 14:41:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 14:41:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 14:41:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 14:41:51,327 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 14:41:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:51,327 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 14:41:51,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:41:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 14:41:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:41:51,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:51,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:51,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-07 14:41:51,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:41:51,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379108847] [2019-12-07 14:41:51,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:51,393 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:41:51,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379108847] [2019-12-07 14:41:51,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:51,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:41:51,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535606432] [2019-12-07 14:41:51,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:41:51,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:41:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:41:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:41:51,395 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 14:41:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:52,502 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-07 14:41:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:41:52,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:41:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:52,901 INFO L225 Difference]: With dead ends: 159677 [2019-12-07 14:41:52,901 INFO L226 Difference]: Without dead ends: 159565 [2019-12-07 14:41:52,901 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:41:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-07 14:42:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-07 14:42:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-07 14:42:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-07 14:42:00,702 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-07 14:42:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:00,703 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-07 14:42:00,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-07 14:42:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:42:00,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:00,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:00,706 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-07 14:42:00,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:00,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661143335] [2019-12-07 14:42:00,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:00,737 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:42:00,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661143335] [2019-12-07 14:42:00,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:00,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:42:00,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045630335] [2019-12-07 14:42:00,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:42:00,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:42:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:42:00,738 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-07 14:42:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:01,524 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-07 14:42:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:42:01,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:42:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:02,000 INFO L225 Difference]: With dead ends: 181618 [2019-12-07 14:42:02,000 INFO L226 Difference]: Without dead ends: 181618 [2019-12-07 14:42:02,000 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:42:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-07 14:42:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-07 14:42:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-07 14:42:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-07 14:42:09,116 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-07 14:42:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:09,116 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-07 14:42:09,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:42:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-07 14:42:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:42:09,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:09,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:09,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-07 14:42:09,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:09,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301794339] [2019-12-07 14:42:09,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:09,163 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:42:09,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301794339] [2019-12-07 14:42:09,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:09,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:09,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248194650] [2019-12-07 14:42:09,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:09,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:09,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:09,165 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-07 14:42:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:10,048 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-07 14:42:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:42:10,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:42:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:12,517 INFO L225 Difference]: With dead ends: 179622 [2019-12-07 14:42:12,517 INFO L226 Difference]: Without dead ends: 179542 [2019-12-07 14:42:12,518 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:42:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-07 14:42:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-07 14:42:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-07 14:42:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-07 14:42:19,301 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-07 14:42:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:19,301 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-07 14:42:19,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-07 14:42:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:42:19,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:19,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:19,304 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-07 14:42:19,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:19,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892570134] [2019-12-07 14:42:19,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:19,338 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:42:19,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892570134] [2019-12-07 14:42:19,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:19,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:19,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822804334] [2019-12-07 14:42:19,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:19,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:19,339 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-07 14:42:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:20,264 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-07 14:42:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:42:20,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:42:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:20,745 INFO L225 Difference]: With dead ends: 189091 [2019-12-07 14:42:20,746 INFO L226 Difference]: Without dead ends: 188995 [2019-12-07 14:42:20,746 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:42:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-07 14:42:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-07 14:42:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-07 14:42:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-07 14:42:28,391 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-07 14:42:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:28,391 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-07 14:42:28,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-07 14:42:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:42:28,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:28,405 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:42:28,405 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-07 14:42:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:28,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103794155] [2019-12-07 14:42:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:28,463 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:42:28,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103794155] [2019-12-07 14:42:28,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:28,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:42:28,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044380509] [2019-12-07 14:42:28,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:42:28,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:42:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:42:28,465 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-07 14:42:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:30,313 INFO L93 Difference]: Finished difference Result 305174 states and 1252705 transitions. [2019-12-07 14:42:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:42:30,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:42:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:31,059 INFO L225 Difference]: With dead ends: 305174 [2019-12-07 14:42:31,059 INFO L226 Difference]: Without dead ends: 292686 [2019-12-07 14:42:31,059 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:42:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292686 states. [2019-12-07 14:42:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292686 to 281033. [2019-12-07 14:42:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281033 states. [2019-12-07 14:42:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281033 states to 281033 states and 1162981 transitions. [2019-12-07 14:42:44,915 INFO L78 Accepts]: Start accepts. Automaton has 281033 states and 1162981 transitions. Word has length 18 [2019-12-07 14:42:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:44,915 INFO L462 AbstractCegarLoop]: Abstraction has 281033 states and 1162981 transitions. [2019-12-07 14:42:44,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:42:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 281033 states and 1162981 transitions. [2019-12-07 14:42:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:42:44,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:44,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:44,940 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1446438801, now seen corresponding path program 1 times [2019-12-07 14:42:44,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613980294] [2019-12-07 14:42:44,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:44,991 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:42:44,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613980294] [2019-12-07 14:42:44,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:44,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:44,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304272263] [2019-12-07 14:42:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:44,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:44,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:44,992 INFO L87 Difference]: Start difference. First operand 281033 states and 1162981 transitions. Second operand 4 states. [2019-12-07 14:42:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:46,729 INFO L93 Difference]: Finished difference Result 288488 states and 1185523 transitions. [2019-12-07 14:42:46,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:42:46,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:42:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:47,474 INFO L225 Difference]: With dead ends: 288488 [2019-12-07 14:42:47,474 INFO L226 Difference]: Without dead ends: 287216 [2019-12-07 14:42:47,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:42:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287216 states. [2019-12-07 14:43:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287216 to 271852. [2019-12-07 14:43:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271852 states. [2019-12-07 14:43:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271852 states to 271852 states and 1126060 transitions. [2019-12-07 14:43:01,214 INFO L78 Accepts]: Start accepts. Automaton has 271852 states and 1126060 transitions. Word has length 19 [2019-12-07 14:43:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:01,214 INFO L462 AbstractCegarLoop]: Abstraction has 271852 states and 1126060 transitions. [2019-12-07 14:43:01,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:43:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 271852 states and 1126060 transitions. [2019-12-07 14:43:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:43:01,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:01,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:01,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-07 14:43:01,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:01,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091259668] [2019-12-07 14:43:01,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:01,289 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:43:01,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091259668] [2019-12-07 14:43:01,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:01,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:01,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020946868] [2019-12-07 14:43:01,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:01,291 INFO L87 Difference]: Start difference. First operand 271852 states and 1126060 transitions. Second operand 5 states. [2019-12-07 14:43:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:03,682 INFO L93 Difference]: Finished difference Result 372957 states and 1508186 transitions. [2019-12-07 14:43:03,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:43:03,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:43:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:05,341 INFO L225 Difference]: With dead ends: 372957 [2019-12-07 14:43:05,341 INFO L226 Difference]: Without dead ends: 372405 [2019-12-07 14:43:05,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:43:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372405 states. [2019-12-07 14:43:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372405 to 278586. [2019-12-07 14:43:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278586 states. [2019-12-07 14:43:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278586 states to 278586 states and 1151080 transitions. [2019-12-07 14:43:20,996 INFO L78 Accepts]: Start accepts. Automaton has 278586 states and 1151080 transitions. Word has length 19 [2019-12-07 14:43:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:20,997 INFO L462 AbstractCegarLoop]: Abstraction has 278586 states and 1151080 transitions. [2019-12-07 14:43:20,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 278586 states and 1151080 transitions. [2019-12-07 14:43:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:43:21,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:21,031 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:43:21,032 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2032195279, now seen corresponding path program 1 times [2019-12-07 14:43:21,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:21,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541671404] [2019-12-07 14:43:21,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:21,076 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:43:21,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541671404] [2019-12-07 14:43:21,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:21,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:21,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319931606] [2019-12-07 14:43:21,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:21,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:21,078 INFO L87 Difference]: Start difference. First operand 278586 states and 1151080 transitions. Second operand 5 states. [2019-12-07 14:43:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:23,831 INFO L93 Difference]: Finished difference Result 475643 states and 1970419 transitions. [2019-12-07 14:43:23,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:43:23,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:43:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:24,481 INFO L225 Difference]: With dead ends: 475643 [2019-12-07 14:43:24,482 INFO L226 Difference]: Without dead ends: 249315 [2019-12-07 14:43:24,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:43:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249315 states. [2019-12-07 14:43:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249315 to 246462. [2019-12-07 14:43:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246462 states. [2019-12-07 14:43:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246462 states to 246462 states and 1015880 transitions. [2019-12-07 14:43:37,551 INFO L78 Accepts]: Start accepts. Automaton has 246462 states and 1015880 transitions. Word has length 20 [2019-12-07 14:43:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:37,551 INFO L462 AbstractCegarLoop]: Abstraction has 246462 states and 1015880 transitions. [2019-12-07 14:43:37,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 246462 states and 1015880 transitions. [2019-12-07 14:43:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:43:37,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:37,591 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:43:37,591 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1830900290, now seen corresponding path program 1 times [2019-12-07 14:43:37,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:37,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726720284] [2019-12-07 14:43:37,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:37,630 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:43:37,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726720284] [2019-12-07 14:43:37,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:37,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:37,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746581163] [2019-12-07 14:43:37,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:43:37,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:43:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:43:37,631 INFO L87 Difference]: Start difference. First operand 246462 states and 1015880 transitions. Second operand 4 states. [2019-12-07 14:43:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:37,876 INFO L93 Difference]: Finished difference Result 67333 states and 232573 transitions. [2019-12-07 14:43:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:43:37,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:43:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:37,974 INFO L225 Difference]: With dead ends: 67333 [2019-12-07 14:43:37,974 INFO L226 Difference]: Without dead ends: 51685 [2019-12-07 14:43:37,974 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:43:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51685 states. [2019-12-07 14:43:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51685 to 51232. [2019-12-07 14:43:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51232 states. [2019-12-07 14:43:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51232 states to 51232 states and 169225 transitions. [2019-12-07 14:43:39,218 INFO L78 Accepts]: Start accepts. Automaton has 51232 states and 169225 transitions. Word has length 21 [2019-12-07 14:43:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:39,218 INFO L462 AbstractCegarLoop]: Abstraction has 51232 states and 169225 transitions. [2019-12-07 14:43:39,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:43:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 51232 states and 169225 transitions. [2019-12-07 14:43:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:43:39,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:39,224 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:43:39,224 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-07 14:43:39,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:39,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253770003] [2019-12-07 14:43:39,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:39,263 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:43:39,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253770003] [2019-12-07 14:43:39,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:39,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:39,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272487502] [2019-12-07 14:43:39,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:39,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:39,264 INFO L87 Difference]: Start difference. First operand 51232 states and 169225 transitions. Second operand 5 states. [2019-12-07 14:43:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:39,673 INFO L93 Difference]: Finished difference Result 63190 states and 205460 transitions. [2019-12-07 14:43:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:43:39,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 14:43:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:39,778 INFO L225 Difference]: With dead ends: 63190 [2019-12-07 14:43:39,778 INFO L226 Difference]: Without dead ends: 62871 [2019-12-07 14:43:39,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:43:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62871 states. [2019-12-07 14:43:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62871 to 51876. [2019-12-07 14:43:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51876 states. [2019-12-07 14:43:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51876 states to 51876 states and 171174 transitions. [2019-12-07 14:43:40,722 INFO L78 Accepts]: Start accepts. Automaton has 51876 states and 171174 transitions. Word has length 22 [2019-12-07 14:43:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:40,722 INFO L462 AbstractCegarLoop]: Abstraction has 51876 states and 171174 transitions. [2019-12-07 14:43:40,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 51876 states and 171174 transitions. [2019-12-07 14:43:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:43:40,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:40,728 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:43:40,729 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-07 14:43:40,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:40,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024532191] [2019-12-07 14:43:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:43:40,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024532191] [2019-12-07 14:43:40,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:40,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:40,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716574082] [2019-12-07 14:43:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:40,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:40,778 INFO L87 Difference]: Start difference. First operand 51876 states and 171174 transitions. Second operand 5 states. [2019-12-07 14:43:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:41,479 INFO L93 Difference]: Finished difference Result 64360 states and 208936 transitions. [2019-12-07 14:43:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:43:41,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 14:43:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:41,578 INFO L225 Difference]: With dead ends: 64360 [2019-12-07 14:43:41,578 INFO L226 Difference]: Without dead ends: 63921 [2019-12-07 14:43:41,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:43:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63921 states. [2019-12-07 14:43:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63921 to 50621. [2019-12-07 14:43:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50621 states. [2019-12-07 14:43:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50621 states to 50621 states and 166885 transitions. [2019-12-07 14:43:42,520 INFO L78 Accepts]: Start accepts. Automaton has 50621 states and 166885 transitions. Word has length 22 [2019-12-07 14:43:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:42,520 INFO L462 AbstractCegarLoop]: Abstraction has 50621 states and 166885 transitions. [2019-12-07 14:43:42,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 50621 states and 166885 transitions. [2019-12-07 14:43:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:43:42,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:42,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:42,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-07 14:43:42,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:42,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512208798] [2019-12-07 14:43:42,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:42,574 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:43:42,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512208798] [2019-12-07 14:43:42,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:42,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:42,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372613590] [2019-12-07 14:43:42,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:42,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:42,575 INFO L87 Difference]: Start difference. First operand 50621 states and 166885 transitions. Second operand 5 states. [2019-12-07 14:43:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:42,917 INFO L93 Difference]: Finished difference Result 60357 states and 196684 transitions. [2019-12-07 14:43:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:43:42,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 14:43:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:43,012 INFO L225 Difference]: With dead ends: 60357 [2019-12-07 14:43:43,012 INFO L226 Difference]: Without dead ends: 59983 [2019-12-07 14:43:43,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:43:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59983 states. [2019-12-07 14:43:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59983 to 51952. [2019-12-07 14:43:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51952 states. [2019-12-07 14:43:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51952 states to 51952 states and 170927 transitions. [2019-12-07 14:43:44,009 INFO L78 Accepts]: Start accepts. Automaton has 51952 states and 170927 transitions. Word has length 28 [2019-12-07 14:43:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:44,010 INFO L462 AbstractCegarLoop]: Abstraction has 51952 states and 170927 transitions. [2019-12-07 14:43:44,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 51952 states and 170927 transitions. [2019-12-07 14:43:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:43:44,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:44,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:44,027 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-07 14:43:44,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:44,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20198233] [2019-12-07 14:43:44,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:44,050 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:43:44,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20198233] [2019-12-07 14:43:44,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:44,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:44,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315705951] [2019-12-07 14:43:44,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:43:44,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:43:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:43:44,052 INFO L87 Difference]: Start difference. First operand 51952 states and 170927 transitions. Second operand 3 states. [2019-12-07 14:43:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:44,257 INFO L93 Difference]: Finished difference Result 63784 states and 207043 transitions. [2019-12-07 14:43:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:43:44,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 14:43:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:44,354 INFO L225 Difference]: With dead ends: 63784 [2019-12-07 14:43:44,354 INFO L226 Difference]: Without dead ends: 63784 [2019-12-07 14:43:44,354 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:43:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63784 states. [2019-12-07 14:43:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63784 to 54480. [2019-12-07 14:43:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54480 states. [2019-12-07 14:43:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54480 states to 54480 states and 176398 transitions. [2019-12-07 14:43:45,296 INFO L78 Accepts]: Start accepts. Automaton has 54480 states and 176398 transitions. Word has length 28 [2019-12-07 14:43:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:45,297 INFO L462 AbstractCegarLoop]: Abstraction has 54480 states and 176398 transitions. [2019-12-07 14:43:45,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:43:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 54480 states and 176398 transitions. [2019-12-07 14:43:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:43:45,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:45,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:45,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-07 14:43:45,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:45,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371170092] [2019-12-07 14:43:45,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:43:45,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371170092] [2019-12-07 14:43:45,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:45,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:45,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044009007] [2019-12-07 14:43:45,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:45,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:45,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:45,351 INFO L87 Difference]: Start difference. First operand 54480 states and 176398 transitions. Second operand 5 states. [2019-12-07 14:43:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:45,706 INFO L93 Difference]: Finished difference Result 64559 states and 206892 transitions. [2019-12-07 14:43:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:43:45,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 14:43:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:45,803 INFO L225 Difference]: With dead ends: 64559 [2019-12-07 14:43:45,803 INFO L226 Difference]: Without dead ends: 64165 [2019-12-07 14:43:45,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:43:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64165 states. [2019-12-07 14:43:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64165 to 54057. [2019-12-07 14:43:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54057 states. [2019-12-07 14:43:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54057 states to 54057 states and 175015 transitions. [2019-12-07 14:43:46,830 INFO L78 Accepts]: Start accepts. Automaton has 54057 states and 175015 transitions. Word has length 29 [2019-12-07 14:43:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:46,830 INFO L462 AbstractCegarLoop]: Abstraction has 54057 states and 175015 transitions. [2019-12-07 14:43:46,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 54057 states and 175015 transitions. [2019-12-07 14:43:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:43:46,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:46,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:46,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-07 14:43:46,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:46,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405990083] [2019-12-07 14:43:46,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:46,890 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:43:46,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405990083] [2019-12-07 14:43:46,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:46,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:43:46,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681519970] [2019-12-07 14:43:46,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:43:46,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:43:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:43:46,891 INFO L87 Difference]: Start difference. First operand 54057 states and 175015 transitions. Second operand 3 states. [2019-12-07 14:43:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:47,053 INFO L93 Difference]: Finished difference Result 51649 states and 165134 transitions. [2019-12-07 14:43:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:43:47,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 14:43:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:47,134 INFO L225 Difference]: With dead ends: 51649 [2019-12-07 14:43:47,134 INFO L226 Difference]: Without dead ends: 51649 [2019-12-07 14:43:47,134 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:43:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51649 states. [2019-12-07 14:43:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51649 to 49278. [2019-12-07 14:43:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49278 states. [2019-12-07 14:43:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49278 states to 49278 states and 157726 transitions. [2019-12-07 14:43:47,947 INFO L78 Accepts]: Start accepts. Automaton has 49278 states and 157726 transitions. Word has length 30 [2019-12-07 14:43:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:47,947 INFO L462 AbstractCegarLoop]: Abstraction has 49278 states and 157726 transitions. [2019-12-07 14:43:47,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:43:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 49278 states and 157726 transitions. [2019-12-07 14:43:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:43:47,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:47,969 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:43:47,969 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-07 14:43:47,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034164309] [2019-12-07 14:43:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:48,019 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:43:48,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034164309] [2019-12-07 14:43:48,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:48,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:43:48,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201968601] [2019-12-07 14:43:48,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:48,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:48,020 INFO L87 Difference]: Start difference. First operand 49278 states and 157726 transitions. Second operand 5 states. [2019-12-07 14:43:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:48,102 INFO L93 Difference]: Finished difference Result 21512 states and 65722 transitions. [2019-12-07 14:43:48,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:43:48,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 14:43:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:48,124 INFO L225 Difference]: With dead ends: 21512 [2019-12-07 14:43:48,124 INFO L226 Difference]: Without dead ends: 18671 [2019-12-07 14:43:48,124 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:43:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18671 states. [2019-12-07 14:43:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18671 to 18319. [2019-12-07 14:43:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-07 14:43:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 55746 transitions. [2019-12-07 14:43:48,432 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 55746 transitions. Word has length 31 [2019-12-07 14:43:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:48,432 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 55746 transitions. [2019-12-07 14:43:48,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 55746 transitions. [2019-12-07 14:43:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:43:48,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:48,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:48,448 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-07 14:43:48,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:48,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484979267] [2019-12-07 14:43:48,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:48,490 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:43:48,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484979267] [2019-12-07 14:43:48,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:48,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:43:48,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695168688] [2019-12-07 14:43:48,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:43:48,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:43:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:43:48,491 INFO L87 Difference]: Start difference. First operand 18319 states and 55746 transitions. Second operand 6 states. [2019-12-07 14:43:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:48,863 INFO L93 Difference]: Finished difference Result 22205 states and 65998 transitions. [2019-12-07 14:43:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:43:48,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 14:43:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:48,886 INFO L225 Difference]: With dead ends: 22205 [2019-12-07 14:43:48,886 INFO L226 Difference]: Without dead ends: 22018 [2019-12-07 14:43:48,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:43:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22018 states. [2019-12-07 14:43:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22018 to 18190. [2019-12-07 14:43:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18190 states. [2019-12-07 14:43:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18190 states to 18190 states and 55399 transitions. [2019-12-07 14:43:49,163 INFO L78 Accepts]: Start accepts. Automaton has 18190 states and 55399 transitions. Word has length 40 [2019-12-07 14:43:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:49,163 INFO L462 AbstractCegarLoop]: Abstraction has 18190 states and 55399 transitions. [2019-12-07 14:43:49,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:43:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 18190 states and 55399 transitions. [2019-12-07 14:43:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:43:49,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:49,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:49,179 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-07 14:43:49,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:49,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446805147] [2019-12-07 14:43:49,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:49,234 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:43:49,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446805147] [2019-12-07 14:43:49,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:49,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:43:49,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248884769] [2019-12-07 14:43:49,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:43:49,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:49,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:43:49,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:43:49,235 INFO L87 Difference]: Start difference. First operand 18190 states and 55399 transitions. Second operand 6 states. [2019-12-07 14:43:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:49,620 INFO L93 Difference]: Finished difference Result 20918 states and 62519 transitions. [2019-12-07 14:43:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:43:49,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 14:43:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:49,641 INFO L225 Difference]: With dead ends: 20918 [2019-12-07 14:43:49,641 INFO L226 Difference]: Without dead ends: 20647 [2019-12-07 14:43:49,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:43:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20647 states. [2019-12-07 14:43:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20647 to 16806. [2019-12-07 14:43:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2019-12-07 14:43:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 51754 transitions. [2019-12-07 14:43:49,894 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 51754 transitions. Word has length 41 [2019-12-07 14:43:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:49,894 INFO L462 AbstractCegarLoop]: Abstraction has 16806 states and 51754 transitions. [2019-12-07 14:43:49,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:43:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 51754 transitions. [2019-12-07 14:43:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:43:49,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:49,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:49,909 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-07 14:43:49,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:49,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790389138] [2019-12-07 14:43:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:49,938 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:43:49,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790389138] [2019-12-07 14:43:49,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:49,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:43:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117557382] [2019-12-07 14:43:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:43:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:43:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:43:49,939 INFO L87 Difference]: Start difference. First operand 16806 states and 51754 transitions. Second operand 3 states. [2019-12-07 14:43:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:49,980 INFO L93 Difference]: Finished difference Result 15924 states and 48104 transitions. [2019-12-07 14:43:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:43:49,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 14:43:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:50,000 INFO L225 Difference]: With dead ends: 15924 [2019-12-07 14:43:50,000 INFO L226 Difference]: Without dead ends: 15924 [2019-12-07 14:43:50,000 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:43:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15924 states. [2019-12-07 14:43:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15924 to 15620. [2019-12-07 14:43:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15620 states. [2019-12-07 14:43:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15620 states to 15620 states and 47262 transitions. [2019-12-07 14:43:50,213 INFO L78 Accepts]: Start accepts. Automaton has 15620 states and 47262 transitions. Word has length 41 [2019-12-07 14:43:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:50,213 INFO L462 AbstractCegarLoop]: Abstraction has 15620 states and 47262 transitions. [2019-12-07 14:43:50,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:43:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15620 states and 47262 transitions. [2019-12-07 14:43:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:43:50,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:50,227 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] [2019-12-07 14:43:50,227 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1119333898, now seen corresponding path program 1 times [2019-12-07 14:43:50,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:50,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040653123] [2019-12-07 14:43:50,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:50,276 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:43:50,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040653123] [2019-12-07 14:43:50,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:50,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:43:50,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133647130] [2019-12-07 14:43:50,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:43:50,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:43:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:43:50,277 INFO L87 Difference]: Start difference. First operand 15620 states and 47262 transitions. Second operand 6 states. [2019-12-07 14:43:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:50,354 INFO L93 Difference]: Finished difference Result 14158 states and 43863 transitions. [2019-12-07 14:43:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:43:50,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 14:43:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:50,370 INFO L225 Difference]: With dead ends: 14158 [2019-12-07 14:43:50,370 INFO L226 Difference]: Without dead ends: 13874 [2019-12-07 14:43:50,371 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:43:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13874 states. [2019-12-07 14:43:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13874 to 9698. [2019-12-07 14:43:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9698 states. [2019-12-07 14:43:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 29812 transitions. [2019-12-07 14:43:50,530 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 29812 transitions. Word has length 42 [2019-12-07 14:43:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:50,531 INFO L462 AbstractCegarLoop]: Abstraction has 9698 states and 29812 transitions. [2019-12-07 14:43:50,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:43:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 29812 transitions. [2019-12-07 14:43:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:50,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:50,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:50,539 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1613813162, now seen corresponding path program 1 times [2019-12-07 14:43:50,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:50,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508498531] [2019-12-07 14:43:50,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:50,595 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:43:50,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508498531] [2019-12-07 14:43:50,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:50,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:43:50,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028707679] [2019-12-07 14:43:50,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:43:50,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:43:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:43:50,596 INFO L87 Difference]: Start difference. First operand 9698 states and 29812 transitions. Second operand 5 states. [2019-12-07 14:43:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:50,702 INFO L93 Difference]: Finished difference Result 25725 states and 80296 transitions. [2019-12-07 14:43:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:43:50,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 14:43:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:50,714 INFO L225 Difference]: With dead ends: 25725 [2019-12-07 14:43:50,714 INFO L226 Difference]: Without dead ends: 11994 [2019-12-07 14:43:50,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:43:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11994 states. [2019-12-07 14:43:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11994 to 7352. [2019-12-07 14:43:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7352 states. [2019-12-07 14:43:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 22762 transitions. [2019-12-07 14:43:50,844 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 22762 transitions. Word has length 56 [2019-12-07 14:43:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:50,844 INFO L462 AbstractCegarLoop]: Abstraction has 7352 states and 22762 transitions. [2019-12-07 14:43:50,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:43:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 22762 transitions. [2019-12-07 14:43:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:50,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:50,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:50,850 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1782045904, now seen corresponding path program 2 times [2019-12-07 14:43:50,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800787050] [2019-12-07 14:43:50,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:50,898 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:43:50,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800787050] [2019-12-07 14:43:50,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:50,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:43:50,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794695047] [2019-12-07 14:43:50,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:43:50,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:43:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:43:50,899 INFO L87 Difference]: Start difference. First operand 7352 states and 22762 transitions. Second operand 4 states. [2019-12-07 14:43:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:50,933 INFO L93 Difference]: Finished difference Result 11994 states and 37458 transitions. [2019-12-07 14:43:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:43:50,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 14:43:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:50,938 INFO L225 Difference]: With dead ends: 11994 [2019-12-07 14:43:50,938 INFO L226 Difference]: Without dead ends: 4819 [2019-12-07 14:43:50,938 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:43:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-07 14:43:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-12-07 14:43:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-12-07 14:43:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 15164 transitions. [2019-12-07 14:43:51,010 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 15164 transitions. Word has length 56 [2019-12-07 14:43:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:51,010 INFO L462 AbstractCegarLoop]: Abstraction has 4819 states and 15164 transitions. [2019-12-07 14:43:51,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:43:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 15164 transitions. [2019-12-07 14:43:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:51,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:51,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:51,014 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 3 times [2019-12-07 14:43:51,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:51,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474278893] [2019-12-07 14:43:51,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:51,194 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:43:51,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474278893] [2019-12-07 14:43:51,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:51,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:43:51,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495085201] [2019-12-07 14:43:51,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:43:51,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:43:51,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:43:51,195 INFO L87 Difference]: Start difference. First operand 4819 states and 15164 transitions. Second operand 11 states. [2019-12-07 14:43:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:51,784 INFO L93 Difference]: Finished difference Result 8855 states and 27526 transitions. [2019-12-07 14:43:51,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:43:51,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 14:43:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:51,794 INFO L225 Difference]: With dead ends: 8855 [2019-12-07 14:43:51,794 INFO L226 Difference]: Without dead ends: 6209 [2019-12-07 14:43:51,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:43:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-12-07 14:43:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 5869. [2019-12-07 14:43:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5869 states. [2019-12-07 14:43:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 18270 transitions. [2019-12-07 14:43:51,885 INFO L78 Accepts]: Start accepts. Automaton has 5869 states and 18270 transitions. Word has length 56 [2019-12-07 14:43:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:51,885 INFO L462 AbstractCegarLoop]: Abstraction has 5869 states and 18270 transitions. [2019-12-07 14:43:51,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:43:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5869 states and 18270 transitions. [2019-12-07 14:43:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:51,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:51,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:51,890 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1236301856, now seen corresponding path program 4 times [2019-12-07 14:43:51,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:51,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763370148] [2019-12-07 14:43:51,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:52,175 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:43:52,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763370148] [2019-12-07 14:43:52,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:52,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 14:43:52,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335465866] [2019-12-07 14:43:52,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:43:52,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:52,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:43:52,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:43:52,176 INFO L87 Difference]: Start difference. First operand 5869 states and 18270 transitions. Second operand 15 states. [2019-12-07 14:43:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:53,991 INFO L93 Difference]: Finished difference Result 8625 states and 26207 transitions. [2019-12-07 14:43:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:43:53,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 14:43:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:54,000 INFO L225 Difference]: With dead ends: 8625 [2019-12-07 14:43:54,001 INFO L226 Difference]: Without dead ends: 7669 [2019-12-07 14:43:54,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 14:43:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2019-12-07 14:43:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6161. [2019-12-07 14:43:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6161 states. [2019-12-07 14:43:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 19256 transitions. [2019-12-07 14:43:54,099 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 19256 transitions. Word has length 56 [2019-12-07 14:43:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:54,099 INFO L462 AbstractCegarLoop]: Abstraction has 6161 states and 19256 transitions. [2019-12-07 14:43:54,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:43:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 19256 transitions. [2019-12-07 14:43:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:54,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:54,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:54,104 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1624094176, now seen corresponding path program 5 times [2019-12-07 14:43:54,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:54,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702514213] [2019-12-07 14:43:54,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:54,226 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:43:54,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702514213] [2019-12-07 14:43:54,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:54,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:43:54,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346826565] [2019-12-07 14:43:54,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:43:54,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:43:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:43:54,227 INFO L87 Difference]: Start difference. First operand 6161 states and 19256 transitions. Second operand 10 states. [2019-12-07 14:43:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:54,921 INFO L93 Difference]: Finished difference Result 9793 states and 30082 transitions. [2019-12-07 14:43:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:43:54,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 14:43:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:54,935 INFO L225 Difference]: With dead ends: 9793 [2019-12-07 14:43:54,935 INFO L226 Difference]: Without dead ends: 7027 [2019-12-07 14:43:54,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:43:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2019-12-07 14:43:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 6083. [2019-12-07 14:43:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6083 states. [2019-12-07 14:43:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6083 states to 6083 states and 18828 transitions. [2019-12-07 14:43:55,035 INFO L78 Accepts]: Start accepts. Automaton has 6083 states and 18828 transitions. Word has length 56 [2019-12-07 14:43:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:55,035 INFO L462 AbstractCegarLoop]: Abstraction has 6083 states and 18828 transitions. [2019-12-07 14:43:55,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:43:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6083 states and 18828 transitions. [2019-12-07 14:43:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:55,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:55,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:55,041 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -711328716, now seen corresponding path program 6 times [2019-12-07 14:43:55,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:55,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295592859] [2019-12-07 14:43:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:55,348 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:43:55,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295592859] [2019-12-07 14:43:55,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:55,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:43:55,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430759797] [2019-12-07 14:43:55,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:43:55,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:43:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:43:55,349 INFO L87 Difference]: Start difference. First operand 6083 states and 18828 transitions. Second operand 14 states. [2019-12-07 14:43:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:56,296 INFO L93 Difference]: Finished difference Result 9105 states and 27804 transitions. [2019-12-07 14:43:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:43:56,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 14:43:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:56,306 INFO L225 Difference]: With dead ends: 9105 [2019-12-07 14:43:56,306 INFO L226 Difference]: Without dead ends: 8667 [2019-12-07 14:43:56,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:43:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states. [2019-12-07 14:43:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 6679. [2019-12-07 14:43:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-12-07 14:43:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 20453 transitions. [2019-12-07 14:43:56,412 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 20453 transitions. Word has length 56 [2019-12-07 14:43:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:56,412 INFO L462 AbstractCegarLoop]: Abstraction has 6679 states and 20453 transitions. [2019-12-07 14:43:56,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:43:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 20453 transitions. [2019-12-07 14:43:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:56,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:56,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:56,418 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash 985934096, now seen corresponding path program 7 times [2019-12-07 14:43:56,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:56,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710521568] [2019-12-07 14:43:56,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:56,524 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:43:56,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710521568] [2019-12-07 14:43:56,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:56,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:43:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139903679] [2019-12-07 14:43:56,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:43:56,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:43:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:43:56,525 INFO L87 Difference]: Start difference. First operand 6679 states and 20453 transitions. Second operand 10 states. [2019-12-07 14:43:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:57,107 INFO L93 Difference]: Finished difference Result 11672 states and 35165 transitions. [2019-12-07 14:43:57,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:43:57,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 14:43:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:57,115 INFO L225 Difference]: With dead ends: 11672 [2019-12-07 14:43:57,116 INFO L226 Difference]: Without dead ends: 7692 [2019-12-07 14:43:57,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:43:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2019-12-07 14:43:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 6450. [2019-12-07 14:43:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6450 states. [2019-12-07 14:43:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 19623 transitions. [2019-12-07 14:43:57,214 INFO L78 Accepts]: Start accepts. Automaton has 6450 states and 19623 transitions. Word has length 56 [2019-12-07 14:43:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:57,215 INFO L462 AbstractCegarLoop]: Abstraction has 6450 states and 19623 transitions. [2019-12-07 14:43:57,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:43:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6450 states and 19623 transitions. [2019-12-07 14:43:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:57,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:57,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:57,220 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 259978164, now seen corresponding path program 8 times [2019-12-07 14:43:57,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:57,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132020591] [2019-12-07 14:43:57,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:43:57,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132020591] [2019-12-07 14:43:57,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:57,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:43:57,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073962421] [2019-12-07 14:43:57,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:43:57,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:43:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:43:57,337 INFO L87 Difference]: Start difference. First operand 6450 states and 19623 transitions. Second operand 11 states. [2019-12-07 14:43:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:58,203 INFO L93 Difference]: Finished difference Result 9154 states and 27325 transitions. [2019-12-07 14:43:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:43:58,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 14:43:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:58,217 INFO L225 Difference]: With dead ends: 9154 [2019-12-07 14:43:58,217 INFO L226 Difference]: Without dead ends: 7252 [2019-12-07 14:43:58,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:43:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2019-12-07 14:43:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 6422. [2019-12-07 14:43:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-12-07 14:43:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 19521 transitions. [2019-12-07 14:43:58,318 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 19521 transitions. Word has length 56 [2019-12-07 14:43:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:58,319 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 19521 transitions. [2019-12-07 14:43:58,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:43:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 19521 transitions. [2019-12-07 14:43:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:58,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:58,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:58,324 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:58,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1250250812, now seen corresponding path program 9 times [2019-12-07 14:43:58,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:58,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250538562] [2019-12-07 14:43:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:58,432 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:43:58,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250538562] [2019-12-07 14:43:58,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:58,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:43:58,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597782712] [2019-12-07 14:43:58,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:43:58,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:43:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:43:58,433 INFO L87 Difference]: Start difference. First operand 6422 states and 19521 transitions. Second operand 11 states. [2019-12-07 14:43:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:43:58,829 INFO L93 Difference]: Finished difference Result 9116 states and 27644 transitions. [2019-12-07 14:43:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:43:58,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 14:43:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:58,838 INFO L225 Difference]: With dead ends: 9116 [2019-12-07 14:43:58,838 INFO L226 Difference]: Without dead ends: 8806 [2019-12-07 14:43:58,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:43:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8806 states. [2019-12-07 14:43:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8806 to 8202. [2019-12-07 14:43:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8202 states. [2019-12-07 14:43:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 24945 transitions. [2019-12-07 14:43:58,964 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 24945 transitions. Word has length 56 [2019-12-07 14:43:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:43:58,964 INFO L462 AbstractCegarLoop]: Abstraction has 8202 states and 24945 transitions. [2019-12-07 14:43:58,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:43:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 24945 transitions. [2019-12-07 14:43:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:43:58,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:43:58,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:43:58,971 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:43:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:43:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash 447012000, now seen corresponding path program 10 times [2019-12-07 14:43:58,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:43:58,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188878048] [2019-12-07 14:43:58,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:43:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:43:59,200 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:43:59,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188878048] [2019-12-07 14:43:59,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:43:59,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:43:59,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816998230] [2019-12-07 14:43:59,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:43:59,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:43:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:43:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:43:59,201 INFO L87 Difference]: Start difference. First operand 8202 states and 24945 transitions. Second operand 14 states. [2019-12-07 14:44:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:02,398 INFO L93 Difference]: Finished difference Result 10634 states and 31903 transitions. [2019-12-07 14:44:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:44:02,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 14:44:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:02,419 INFO L225 Difference]: With dead ends: 10634 [2019-12-07 14:44:02,419 INFO L226 Difference]: Without dead ends: 9950 [2019-12-07 14:44:02,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:44:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9950 states. [2019-12-07 14:44:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9950 to 8622. [2019-12-07 14:44:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8622 states. [2019-12-07 14:44:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 26312 transitions. [2019-12-07 14:44:02,552 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 26312 transitions. Word has length 56 [2019-12-07 14:44:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:02,552 INFO L462 AbstractCegarLoop]: Abstraction has 8622 states and 26312 transitions. [2019-12-07 14:44:02,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:44:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 26312 transitions. [2019-12-07 14:44:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:44:02,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:02,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:02,560 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 50096068, now seen corresponding path program 11 times [2019-12-07 14:44:02,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:02,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212013818] [2019-12-07 14:44:02,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:02,692 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:44:02,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212013818] [2019-12-07 14:44:02,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:02,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:44:02,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456325267] [2019-12-07 14:44:02,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:44:02,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:44:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:44:02,693 INFO L87 Difference]: Start difference. First operand 8622 states and 26312 transitions. Second operand 11 states. [2019-12-07 14:44:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:03,076 INFO L93 Difference]: Finished difference Result 9574 states and 28770 transitions. [2019-12-07 14:44:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:44:03,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 14:44:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:03,083 INFO L225 Difference]: With dead ends: 9574 [2019-12-07 14:44:03,083 INFO L226 Difference]: Without dead ends: 6868 [2019-12-07 14:44:03,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:44:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2019-12-07 14:44:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6062. [2019-12-07 14:44:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6062 states. [2019-12-07 14:44:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 18439 transitions. [2019-12-07 14:44:03,172 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 18439 transitions. Word has length 56 [2019-12-07 14:44:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:03,172 INFO L462 AbstractCegarLoop]: Abstraction has 6062 states and 18439 transitions. [2019-12-07 14:44:03,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:44:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 18439 transitions. [2019-12-07 14:44:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:44:03,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:03,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:03,177 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 12 times [2019-12-07 14:44:03,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:03,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388475722] [2019-12-07 14:44:03,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:03,288 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:44:03,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388475722] [2019-12-07 14:44:03,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:03,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:44:03,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600301767] [2019-12-07 14:44:03,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:44:03,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:44:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:44:03,289 INFO L87 Difference]: Start difference. First operand 6062 states and 18439 transitions. Second operand 12 states. [2019-12-07 14:44:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:03,837 INFO L93 Difference]: Finished difference Result 7022 states and 20912 transitions. [2019-12-07 14:44:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:44:03,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 14:44:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:03,844 INFO L225 Difference]: With dead ends: 7022 [2019-12-07 14:44:03,844 INFO L226 Difference]: Without dead ends: 6688 [2019-12-07 14:44:03,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 14:44:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2019-12-07 14:44:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5910. [2019-12-07 14:44:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5910 states. [2019-12-07 14:44:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 18009 transitions. [2019-12-07 14:44:03,930 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 18009 transitions. Word has length 56 [2019-12-07 14:44:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:03,931 INFO L462 AbstractCegarLoop]: Abstraction has 5910 states and 18009 transitions. [2019-12-07 14:44:03,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:44:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 18009 transitions. [2019-12-07 14:44:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:44:03,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:03,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:03,935 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 13 times [2019-12-07 14:44:03,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:03,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940693807] [2019-12-07 14:44:03,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:44:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:44:04,007 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:44:04,007 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:44:04,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26|) |v_ULTIMATE.start_main_~#t1903~0.offset_20| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard1~0_51 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26|) 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 |v_ULTIMATE.start_main_~#t1903~0.offset_20|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1903~0.base_26|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_21|, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_27|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_14|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1903~0.base=|v_ULTIMATE.start_main_~#t1903~0.base_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1903~0.offset=|v_ULTIMATE.start_main_~#t1903~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1904~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1904~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1905~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1903~0.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1903~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:44:04,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1904~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1904~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10|) |v_ULTIMATE.start_main_~#t1904~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1904~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1904~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1904~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 14:44:04,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:44:04,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1905~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11|) |v_ULTIMATE.start_main_~#t1905~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1905~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1905~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t1905~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base] because there is no mapped edge [2019-12-07 14:44:04,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In739893157 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In739893157 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In739893157 |P2Thread1of1ForFork1_#t~ite32_Out739893157|)) (and (= ~x~0_In739893157 |P2Thread1of1ForFork1_#t~ite32_Out739893157|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In739893157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In739893157, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In739893157, ~x~0=~x~0_In739893157} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out739893157|, ~x$w_buff1~0=~x$w_buff1~0_In739893157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In739893157, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In739893157, ~x~0=~x~0_In739893157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:44:04,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-813252271 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-813252271 256) 0))) (or (and (= ~x$w_buff0_used~0_In-813252271 |P2Thread1of1ForFork1_#t~ite34_Out-813252271|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-813252271| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-813252271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-813252271} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-813252271|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-813252271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-813252271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:44:04,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-715135103 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-715135103| |P0Thread1of1ForFork2_#t~ite8_Out-715135103|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-715135103 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-715135103 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-715135103 256))) (and (= (mod ~x$w_buff1_used~0_In-715135103 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite8_Out-715135103| ~x$w_buff0~0_In-715135103)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-715135103| |P0Thread1of1ForFork2_#t~ite8_Out-715135103|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite9_Out-715135103| ~x$w_buff0~0_In-715135103)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-715135103, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-715135103, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-715135103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-715135103, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-715135103, ~weak$$choice2~0=~weak$$choice2~0_In-715135103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715135103} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-715135103, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-715135103, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-715135103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-715135103, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-715135103|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-715135103, ~weak$$choice2~0=~weak$$choice2~0_In-715135103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715135103} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 14:44:04,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-232620481 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-232620481 256)))) (or (and (= ~x$w_buff0_used~0_In-232620481 |P1Thread1of1ForFork0_#t~ite28_Out-232620481|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-232620481|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-232620481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232620481} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-232620481, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-232620481|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232620481} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:44:04,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In642437730 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In642437730 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In642437730 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In642437730 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out642437730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out642437730| ~x$w_buff1_used~0_In642437730)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In642437730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In642437730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In642437730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642437730} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In642437730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In642437730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In642437730, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out642437730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642437730} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:44:04,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2130257367 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2130257367 256))) (.cse2 (= ~x$r_buff0_thd2~0_In2130257367 ~x$r_buff0_thd2~0_Out2130257367))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out2130257367)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130257367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130257367} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2130257367|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2130257367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130257367} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:44:04,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-990267826 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-990267826 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-990267826 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-990267826 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-990267826| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-990267826| ~x$r_buff1_thd2~0_In-990267826)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-990267826, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990267826, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990267826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990267826} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-990267826|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-990267826, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990267826, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990267826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990267826} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:44:04,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:44:04,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In185131072 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In185131072 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In185131072 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In185131072 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out185131072| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In185131072 |P2Thread1of1ForFork1_#t~ite35_Out185131072|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In185131072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In185131072, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In185131072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185131072} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out185131072|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185131072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In185131072, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In185131072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185131072} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:44:04,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1975506304 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1975506304 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1975506304|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1975506304 |P2Thread1of1ForFork1_#t~ite36_Out-1975506304|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1975506304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975506304} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1975506304|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1975506304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975506304} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:44:04,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-99607537 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-99607537| |P0Thread1of1ForFork2_#t~ite17_Out-99607537|) (= ~x$w_buff1_used~0_In-99607537 |P0Thread1of1ForFork2_#t~ite18_Out-99607537|)) (and (= ~x$w_buff1_used~0_In-99607537 |P0Thread1of1ForFork2_#t~ite17_Out-99607537|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-99607537 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-99607537 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-99607537 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-99607537 256)))) (= |P0Thread1of1ForFork2_#t~ite18_Out-99607537| |P0Thread1of1ForFork2_#t~ite17_Out-99607537|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-99607537, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-99607537|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99607537, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-99607537, ~weak$$choice2~0=~weak$$choice2~0_In-99607537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99607537} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-99607537, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-99607537|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-99607537|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99607537, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-99607537, ~weak$$choice2~0=~weak$$choice2~0_In-99607537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99607537} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:44:04,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:44:04,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-957102742 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-957102742| ~x$r_buff1_thd1~0_In-957102742) (= |P0Thread1of1ForFork2_#t~ite23_Out-957102742| |P0Thread1of1ForFork2_#t~ite24_Out-957102742|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-957102742 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-957102742 256) 0)) (= (mod ~x$w_buff0_used~0_In-957102742 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-957102742 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite23_In-957102742| |P0Thread1of1ForFork2_#t~ite23_Out-957102742|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-957102742| ~x$r_buff1_thd1~0_In-957102742)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-957102742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-957102742, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-957102742, ~weak$$choice2~0=~weak$$choice2~0_In-957102742, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-957102742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957102742} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-957102742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-957102742, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-957102742, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-957102742|, ~weak$$choice2~0=~weak$$choice2~0_In-957102742, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-957102742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957102742} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 14:44:04,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1827821854 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1827821854 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1827821854 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1827821854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1827821854| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1827821854| ~x$r_buff1_thd3~0_In1827821854) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1827821854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1827821854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1827821854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827821854} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1827821854|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1827821854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1827821854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1827821854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827821854} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:04,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:44:04,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:44:04,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In30164858 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In30164858 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In30164858 |ULTIMATE.start_main_#t~ite41_Out30164858|)) (and (not .cse1) (= ~x$w_buff1~0_In30164858 |ULTIMATE.start_main_#t~ite41_Out30164858|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In30164858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In30164858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In30164858, ~x~0=~x~0_In30164858} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out30164858|, ~x$w_buff1~0=~x$w_buff1~0_In30164858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In30164858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In30164858, ~x~0=~x~0_In30164858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:44:04,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1489740262 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1489740262 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1489740262| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1489740262 |ULTIMATE.start_main_#t~ite43_Out-1489740262|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1489740262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1489740262} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1489740262, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1489740262|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1489740262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:44:04,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1116663313 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1116663313 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1116663313 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1116663313 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1116663313|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1116663313 |ULTIMATE.start_main_#t~ite44_Out1116663313|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116663313, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116663313, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1116663313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116663313} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116663313, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116663313, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1116663313, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1116663313|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116663313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:44:04,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1304113278 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1304113278 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1304113278| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out1304113278| ~x$r_buff0_thd0~0_In1304113278) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304113278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304113278} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304113278, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1304113278|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304113278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:44:04,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-179604758 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-179604758 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-179604758 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-179604758 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-179604758 |ULTIMATE.start_main_#t~ite46_Out-179604758|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-179604758|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-179604758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-179604758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-179604758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179604758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-179604758, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-179604758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-179604758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-179604758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179604758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:44:04,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:44:04,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:44:04 BasicIcfg [2019-12-07 14:44:04,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:44:04,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:44:04,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:44:04,079 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:44:04,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:25" (3/4) ... [2019-12-07 14:44:04,081 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:44:04,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26|) |v_ULTIMATE.start_main_~#t1903~0.offset_20| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard1~0_51 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26|) 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 |v_ULTIMATE.start_main_~#t1903~0.offset_20|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1903~0.base_26|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_21|, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_27|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_14|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1903~0.base=|v_ULTIMATE.start_main_~#t1903~0.base_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1903~0.offset=|v_ULTIMATE.start_main_~#t1903~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1904~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1904~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1905~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1903~0.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1903~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:44:04,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1904~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1904~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10|) |v_ULTIMATE.start_main_~#t1904~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1904~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1904~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1904~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 14:44:04,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:44:04,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1905~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11|) |v_ULTIMATE.start_main_~#t1905~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1905~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1905~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t1905~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base] because there is no mapped edge [2019-12-07 14:44:04,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In739893157 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In739893157 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In739893157 |P2Thread1of1ForFork1_#t~ite32_Out739893157|)) (and (= ~x~0_In739893157 |P2Thread1of1ForFork1_#t~ite32_Out739893157|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In739893157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In739893157, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In739893157, ~x~0=~x~0_In739893157} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out739893157|, ~x$w_buff1~0=~x$w_buff1~0_In739893157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In739893157, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In739893157, ~x~0=~x~0_In739893157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:44:04,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-813252271 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-813252271 256) 0))) (or (and (= ~x$w_buff0_used~0_In-813252271 |P2Thread1of1ForFork1_#t~ite34_Out-813252271|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-813252271| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-813252271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-813252271} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-813252271|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-813252271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-813252271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:44:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-715135103 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-715135103| |P0Thread1of1ForFork2_#t~ite8_Out-715135103|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-715135103 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-715135103 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-715135103 256))) (and (= (mod ~x$w_buff1_used~0_In-715135103 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite8_Out-715135103| ~x$w_buff0~0_In-715135103)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-715135103| |P0Thread1of1ForFork2_#t~ite8_Out-715135103|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite9_Out-715135103| ~x$w_buff0~0_In-715135103)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-715135103, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-715135103, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-715135103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-715135103, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-715135103, ~weak$$choice2~0=~weak$$choice2~0_In-715135103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715135103} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-715135103, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-715135103, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-715135103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-715135103, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-715135103|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-715135103, ~weak$$choice2~0=~weak$$choice2~0_In-715135103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-715135103} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 14:44:04,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-232620481 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-232620481 256)))) (or (and (= ~x$w_buff0_used~0_In-232620481 |P1Thread1of1ForFork0_#t~ite28_Out-232620481|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-232620481|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-232620481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232620481} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-232620481, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-232620481|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-232620481} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:44:04,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In642437730 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In642437730 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In642437730 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In642437730 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out642437730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out642437730| ~x$w_buff1_used~0_In642437730)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In642437730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In642437730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In642437730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642437730} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In642437730, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In642437730, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In642437730, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out642437730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642437730} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:44:04,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2130257367 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2130257367 256))) (.cse2 (= ~x$r_buff0_thd2~0_In2130257367 ~x$r_buff0_thd2~0_Out2130257367))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out2130257367)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130257367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130257367} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2130257367|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2130257367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130257367} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:44:04,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-990267826 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-990267826 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-990267826 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-990267826 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-990267826| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-990267826| ~x$r_buff1_thd2~0_In-990267826)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-990267826, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990267826, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990267826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990267826} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-990267826|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-990267826, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990267826, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990267826, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990267826} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:44:04,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:44:04,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In185131072 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In185131072 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In185131072 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In185131072 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out185131072| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In185131072 |P2Thread1of1ForFork1_#t~ite35_Out185131072|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In185131072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In185131072, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In185131072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185131072} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out185131072|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185131072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In185131072, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In185131072, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185131072} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:44:04,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1975506304 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1975506304 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1975506304|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1975506304 |P2Thread1of1ForFork1_#t~ite36_Out-1975506304|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1975506304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975506304} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1975506304|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1975506304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975506304} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:44:04,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-99607537 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-99607537| |P0Thread1of1ForFork2_#t~ite17_Out-99607537|) (= ~x$w_buff1_used~0_In-99607537 |P0Thread1of1ForFork2_#t~ite18_Out-99607537|)) (and (= ~x$w_buff1_used~0_In-99607537 |P0Thread1of1ForFork2_#t~ite17_Out-99607537|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-99607537 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-99607537 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-99607537 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-99607537 256)))) (= |P0Thread1of1ForFork2_#t~ite18_Out-99607537| |P0Thread1of1ForFork2_#t~ite17_Out-99607537|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-99607537, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-99607537|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99607537, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-99607537, ~weak$$choice2~0=~weak$$choice2~0_In-99607537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99607537} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-99607537, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-99607537|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-99607537|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99607537, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-99607537, ~weak$$choice2~0=~weak$$choice2~0_In-99607537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99607537} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:44:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:44:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-957102742 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-957102742| ~x$r_buff1_thd1~0_In-957102742) (= |P0Thread1of1ForFork2_#t~ite23_Out-957102742| |P0Thread1of1ForFork2_#t~ite24_Out-957102742|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-957102742 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-957102742 256) 0)) (= (mod ~x$w_buff0_used~0_In-957102742 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-957102742 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite23_In-957102742| |P0Thread1of1ForFork2_#t~ite23_Out-957102742|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-957102742| ~x$r_buff1_thd1~0_In-957102742)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-957102742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-957102742, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-957102742, ~weak$$choice2~0=~weak$$choice2~0_In-957102742, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-957102742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957102742} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-957102742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-957102742, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-957102742, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-957102742|, ~weak$$choice2~0=~weak$$choice2~0_In-957102742, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-957102742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-957102742} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 14:44:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1827821854 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1827821854 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1827821854 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1827821854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out1827821854| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1827821854| ~x$r_buff1_thd3~0_In1827821854) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1827821854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1827821854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1827821854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827821854} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1827821854|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1827821854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1827821854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1827821854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827821854} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:44:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In30164858 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In30164858 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In30164858 |ULTIMATE.start_main_#t~ite41_Out30164858|)) (and (not .cse1) (= ~x$w_buff1~0_In30164858 |ULTIMATE.start_main_#t~ite41_Out30164858|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In30164858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In30164858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In30164858, ~x~0=~x~0_In30164858} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out30164858|, ~x$w_buff1~0=~x$w_buff1~0_In30164858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In30164858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In30164858, ~x~0=~x~0_In30164858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1489740262 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1489740262 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1489740262| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1489740262 |ULTIMATE.start_main_#t~ite43_Out-1489740262|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1489740262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1489740262} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1489740262, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1489740262|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1489740262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1116663313 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1116663313 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1116663313 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1116663313 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1116663313|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1116663313 |ULTIMATE.start_main_#t~ite44_Out1116663313|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116663313, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116663313, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1116663313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116663313} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1116663313, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116663313, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1116663313, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1116663313|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116663313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:44:04,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1304113278 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1304113278 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1304113278| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out1304113278| ~x$r_buff0_thd0~0_In1304113278) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304113278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304113278} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304113278, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1304113278|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304113278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:44:04,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-179604758 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-179604758 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-179604758 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-179604758 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-179604758 |ULTIMATE.start_main_#t~ite46_Out-179604758|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-179604758|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-179604758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-179604758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-179604758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179604758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-179604758, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-179604758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-179604758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-179604758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179604758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:44:04,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:44:04,151 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8ffe5875-6da1-411b-a36e-dc5beef53d01/bin/utaipan/witness.graphml [2019-12-07 14:44:04,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:44:04,153 INFO L168 Benchmark]: Toolchain (without parser) took 159786.72 ms. Allocated memory was 1.0 GB in the beginning and 9.3 GB in the end (delta: 8.3 GB). Free memory was 933.5 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,153 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:44:04,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,154 INFO L168 Benchmark]: Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:44:04,154 INFO L168 Benchmark]: RCFGBuilder took 382.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,155 INFO L168 Benchmark]: TraceAbstraction took 158883.98 ms. Allocated memory was 1.2 GB in the beginning and 9.3 GB in the end (delta: 8.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,155 INFO L168 Benchmark]: Witness Printer took 73.17 ms. Allocated memory is still 9.3 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:04,156 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158883.98 ms. Allocated memory was 1.2 GB in the beginning and 9.3 GB in the end (delta: 8.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 73.17 ms. Allocated memory is still 9.3 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1905, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5541 SDtfs, 9326 SDslu, 18591 SDs, 0 SdLazy, 10785 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 37 SyntacticMatches, 19 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281033occurred 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: 104.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 316783 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1252 NumberOfCodeBlocks, 1252 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 394920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...