./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_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_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/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 9ebd609ae74dce01544f52ff0ae5ec12f4ab21f9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:36:58,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:36:58,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:36:58,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:36:58,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:36:58,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:36:58,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:36:58,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:36:58,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:36:58,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:36:58,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:36:58,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:36:58,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:36:58,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:36:58,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:36:58,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:36:58,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:36:58,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:36:58,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:36:58,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:36:58,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:36:58,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:36:58,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:36:58,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:36:58,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:36:58,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:36:58,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:36:58,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:36:58,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:36:58,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:36:58,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:36:58,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:36:58,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:36:58,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:36:58,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:36:58,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:36:58,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:36:58,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:36:58,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:36:58,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:36:58,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:36:58,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:36:58,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:36:58,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:36:58,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:36:58,544 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:36:58,545 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:36:58,545 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:36:58,545 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:36:58,546 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:36:58,546 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:36:58,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:36:58,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:36:58,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:36:58,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:36:58,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:36:58,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:36:58,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:36:58,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:36:58,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:36:58,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:36:58,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:36:58,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:36:58,549 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:36:58,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:36:58,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:36:58,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:36:58,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:36:58,549 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_e4eb0717-e404-497c-88b5-0882f46cf893/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 -> 9ebd609ae74dce01544f52ff0ae5ec12f4ab21f9 [2019-12-07 10:36:58,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:36:58,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:36:58,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:36:58,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:36:58,669 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:36:58,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_pso.oepc.i [2019-12-07 10:36:58,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/data/dcd12c191/5c6cc45c53af4e87bcbcffe456bda76e/FLAGcddd1d0ce [2019-12-07 10:36:59,118 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:36:59,118 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/sv-benchmarks/c/pthread-wmm/mix042_pso.oepc.i [2019-12-07 10:36:59,128 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/data/dcd12c191/5c6cc45c53af4e87bcbcffe456bda76e/FLAGcddd1d0ce [2019-12-07 10:36:59,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/data/dcd12c191/5c6cc45c53af4e87bcbcffe456bda76e [2019-12-07 10:36:59,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:36:59,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:36:59,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:36:59,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:36:59,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:36:59,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59, skipping insertion in model container [2019-12-07 10:36:59,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:36:59,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:36:59,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:36:59,771 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:36:59,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:36:59,859 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:36:59,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59 WrapperNode [2019-12-07 10:36:59,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:36:59,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:36:59,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:36:59,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:36:59,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:36:59,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:36:59,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:36:59,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:36:59,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... [2019-12-07 10:36:59,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:36:59,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:36:59,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:36:59,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:36:59,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/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 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:36:59,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:36:59,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:36:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:36:59,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:36:59,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:36:59,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:36:59,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:36:59,968 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 10:37:00,340 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:37:00,340 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:37:00,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:37:00 BoogieIcfgContainer [2019-12-07 10:37:00,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:37:00,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:37:00,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:37:00,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:37:00,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:36:59" (1/3) ... [2019-12-07 10:37:00,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b86dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:37:00, skipping insertion in model container [2019-12-07 10:37:00,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:36:59" (2/3) ... [2019-12-07 10:37:00,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b86dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:37:00, skipping insertion in model container [2019-12-07 10:37:00,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:37:00" (3/3) ... [2019-12-07 10:37:00,346 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-07 10:37:00,352 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:37:00,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:37:00,357 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:37:00,358 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,396 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:37:00,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:37:00,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:37:00,437 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:37:00,437 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:37:00,437 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:37:00,437 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:37:00,437 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:37:00,437 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:37:00,437 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:37:00,448 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-07 10:37:00,449 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 10:37:00,504 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 10:37:00,505 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:37:00,516 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:37:00,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 10:37:00,560 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 10:37:00,560 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:37:00,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:37:00,581 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 10:37:00,582 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:37:03,566 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-07 10:37:03,921 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 10:37:04,019 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-07 10:37:04,020 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 10:37:04,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-07 10:37:15,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-07 10:37:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-07 10:37:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:37:15,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:15,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:37:15,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-07 10:37:15,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:15,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453011246] [2019-12-07 10:37:15,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:15,974 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 10:37:15,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453011246] [2019-12-07 10:37:15,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:15,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:37:15,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872554068] [2019-12-07 10:37:15,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:15,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:15,989 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-07 10:37:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:16,721 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-07 10:37:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:16,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:37:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,137 INFO L225 Difference]: With dead ends: 101544 [2019-12-07 10:37:17,137 INFO L226 Difference]: Without dead ends: 95304 [2019-12-07 10:37:17,138 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 10:37:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-07 10:37:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-07 10:37:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-07 10:37:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-07 10:37:21,868 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-07 10:37:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:21,868 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-07 10:37:21,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-07 10:37:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:37:21,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:21,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:21,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-07 10:37:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:21,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742391322] [2019-12-07 10:37:21,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:21,933 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 10:37:21,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742391322] [2019-12-07 10:37:21,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:21,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:21,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94124149] [2019-12-07 10:37:21,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:21,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:21,935 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-07 10:37:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:24,311 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-07 10:37:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:37:24,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:37:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:24,708 INFO L225 Difference]: With dead ends: 152040 [2019-12-07 10:37:24,708 INFO L226 Difference]: Without dead ends: 151991 [2019-12-07 10:37:24,709 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 10:37:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-07 10:37:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-07 10:37:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-07 10:37:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-07 10:37:31,182 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-07 10:37:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:31,182 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-07 10:37:31,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-07 10:37:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:37:31,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:31,186 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:31,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-07 10:37:31,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:31,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380861107] [2019-12-07 10:37:31,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:31,238 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 10:37:31,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380861107] [2019-12-07 10:37:31,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:31,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:31,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816724307] [2019-12-07 10:37:31,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:31,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:31,239 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 4 states. [2019-12-07 10:37:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:32,243 INFO L93 Difference]: Finished difference Result 197752 states and 794963 transitions. [2019-12-07 10:37:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:37:32,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:37:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:32,754 INFO L225 Difference]: With dead ends: 197752 [2019-12-07 10:37:32,754 INFO L226 Difference]: Without dead ends: 197696 [2019-12-07 10:37:32,754 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 10:37:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197696 states. [2019-12-07 10:37:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197696 to 164675. [2019-12-07 10:37:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164675 states. [2019-12-07 10:37:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164675 states to 164675 states and 674105 transitions. [2019-12-07 10:37:42,064 INFO L78 Accepts]: Start accepts. Automaton has 164675 states and 674105 transitions. Word has length 13 [2019-12-07 10:37:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:42,064 INFO L462 AbstractCegarLoop]: Abstraction has 164675 states and 674105 transitions. [2019-12-07 10:37:42,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 164675 states and 674105 transitions. [2019-12-07 10:37:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:37:42,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:42,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:42,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-07 10:37:42,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:42,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391949597] [2019-12-07 10:37:42,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:42,137 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 10:37:42,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391949597] [2019-12-07 10:37:42,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:42,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:42,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949274308] [2019-12-07 10:37:42,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:42,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:42,139 INFO L87 Difference]: Start difference. First operand 164675 states and 674105 transitions. Second operand 4 states. [2019-12-07 10:37:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:43,620 INFO L93 Difference]: Finished difference Result 202675 states and 826980 transitions. [2019-12-07 10:37:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:37:43,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:37:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:44,134 INFO L225 Difference]: With dead ends: 202675 [2019-12-07 10:37:44,134 INFO L226 Difference]: Without dead ends: 202675 [2019-12-07 10:37:44,134 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 10:37:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202675 states. [2019-12-07 10:37:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202675 to 172880. [2019-12-07 10:37:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172880 states. [2019-12-07 10:37:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172880 states to 172880 states and 708759 transitions. [2019-12-07 10:37:53,932 INFO L78 Accepts]: Start accepts. Automaton has 172880 states and 708759 transitions. Word has length 16 [2019-12-07 10:37:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:53,932 INFO L462 AbstractCegarLoop]: Abstraction has 172880 states and 708759 transitions. [2019-12-07 10:37:53,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 172880 states and 708759 transitions. [2019-12-07 10:37:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:37:53,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:53,943 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 10:37:53,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash -118269295, now seen corresponding path program 1 times [2019-12-07 10:37:53,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:53,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792783318] [2019-12-07 10:37:53,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:53,975 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 10:37:53,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792783318] [2019-12-07 10:37:53,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:53,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:53,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132533818] [2019-12-07 10:37:53,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:53,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:53,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:53,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:53,977 INFO L87 Difference]: Start difference. First operand 172880 states and 708759 transitions. Second operand 3 states. [2019-12-07 10:37:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:54,086 INFO L93 Difference]: Finished difference Result 34553 states and 111512 transitions. [2019-12-07 10:37:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:54,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:37:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:54,471 INFO L225 Difference]: With dead ends: 34553 [2019-12-07 10:37:54,471 INFO L226 Difference]: Without dead ends: 34553 [2019-12-07 10:37:54,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34553 states. [2019-12-07 10:37:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34553 to 34473. [2019-12-07 10:37:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-07 10:37:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-07 10:37:55,021 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 18 [2019-12-07 10:37:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:55,022 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-07 10:37:55,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-07 10:37:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:37:55,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:55,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] [2019-12-07 10:37:55,027 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-07 10:37:55,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:55,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629941979] [2019-12-07 10:37:55,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:55,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 10:37:55,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629941979] [2019-12-07 10:37:55,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:55,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:55,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183777505] [2019-12-07 10:37:55,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:37:55,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:37:55,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:37:55,077 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-07 10:37:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:55,485 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-07 10:37:55,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:37:55,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:37:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:55,545 INFO L225 Difference]: With dead ends: 44779 [2019-12-07 10:37:55,545 INFO L226 Difference]: Without dead ends: 44772 [2019-12-07 10:37:55,546 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 10:37:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-07 10:37:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-07 10:37:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-07 10:37:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-07 10:37:56,182 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-07 10:37:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:56,183 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-07 10:37:56,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:37:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-07 10:37:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:37:56,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:56,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:56,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-07 10:37:56,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:56,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94367897] [2019-12-07 10:37:56,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:56,247 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 10:37:56,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94367897] [2019-12-07 10:37:56,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:56,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:56,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801352090] [2019-12-07 10:37:56,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:37:56,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:37:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:37:56,249 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-07 10:37:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:56,600 INFO L93 Difference]: Finished difference Result 48290 states and 152456 transitions. [2019-12-07 10:37:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:37:56,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:37:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:56,665 INFO L225 Difference]: With dead ends: 48290 [2019-12-07 10:37:56,665 INFO L226 Difference]: Without dead ends: 48277 [2019-12-07 10:37:56,665 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 10:37:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48277 states. [2019-12-07 10:37:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48277 to 39783. [2019-12-07 10:37:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39783 states. [2019-12-07 10:37:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39783 states to 39783 states and 127731 transitions. [2019-12-07 10:37:57,372 INFO L78 Accepts]: Start accepts. Automaton has 39783 states and 127731 transitions. Word has length 25 [2019-12-07 10:37:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:57,372 INFO L462 AbstractCegarLoop]: Abstraction has 39783 states and 127731 transitions. [2019-12-07 10:37:57,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:37:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 39783 states and 127731 transitions. [2019-12-07 10:37:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:37:57,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:57,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:57,383 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-07 10:37:57,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:57,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759029959] [2019-12-07 10:37:57,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:57,406 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 10:37:57,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759029959] [2019-12-07 10:37:57,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:57,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:57,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434871474] [2019-12-07 10:37:57,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:57,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:57,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:57,408 INFO L87 Difference]: Start difference. First operand 39783 states and 127731 transitions. Second operand 3 states. [2019-12-07 10:37:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:57,582 INFO L93 Difference]: Finished difference Result 56828 states and 180787 transitions. [2019-12-07 10:37:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:57,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 10:37:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:57,668 INFO L225 Difference]: With dead ends: 56828 [2019-12-07 10:37:57,668 INFO L226 Difference]: Without dead ends: 56828 [2019-12-07 10:37:57,668 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 10:37:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56828 states. [2019-12-07 10:37:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56828 to 42213. [2019-12-07 10:37:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42213 states. [2019-12-07 10:37:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42213 states to 42213 states and 135001 transitions. [2019-12-07 10:37:58,717 INFO L78 Accepts]: Start accepts. Automaton has 42213 states and 135001 transitions. Word has length 27 [2019-12-07 10:37:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:58,717 INFO L462 AbstractCegarLoop]: Abstraction has 42213 states and 135001 transitions. [2019-12-07 10:37:58,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42213 states and 135001 transitions. [2019-12-07 10:37:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:37:58,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:58,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, 1, 1, 1, 1, 1] [2019-12-07 10:37:58,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-07 10:37:58,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:58,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061685928] [2019-12-07 10:37:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:58,750 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 10:37:58,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061685928] [2019-12-07 10:37:58,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:58,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:58,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517884964] [2019-12-07 10:37:58,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:58,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:58,752 INFO L87 Difference]: Start difference. First operand 42213 states and 135001 transitions. Second operand 3 states. [2019-12-07 10:37:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:58,934 INFO L93 Difference]: Finished difference Result 62192 states and 195378 transitions. [2019-12-07 10:37:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:58,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 10:37:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:59,027 INFO L225 Difference]: With dead ends: 62192 [2019-12-07 10:37:59,027 INFO L226 Difference]: Without dead ends: 62192 [2019-12-07 10:37:59,027 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 10:37:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62192 states. [2019-12-07 10:37:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62192 to 47577. [2019-12-07 10:37:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47577 states. [2019-12-07 10:37:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47577 states to 47577 states and 149592 transitions. [2019-12-07 10:37:59,895 INFO L78 Accepts]: Start accepts. Automaton has 47577 states and 149592 transitions. Word has length 27 [2019-12-07 10:37:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:59,895 INFO L462 AbstractCegarLoop]: Abstraction has 47577 states and 149592 transitions. [2019-12-07 10:37:59,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 47577 states and 149592 transitions. [2019-12-07 10:37:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:37:59,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:59,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:59,908 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:37:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-07 10:37:59,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:59,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58016836] [2019-12-07 10:37:59,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:59,957 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 10:37:59,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58016836] [2019-12-07 10:37:59,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:59,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:37:59,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004844623] [2019-12-07 10:37:59,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:37:59,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:37:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:37:59,958 INFO L87 Difference]: Start difference. First operand 47577 states and 149592 transitions. Second operand 6 states. [2019-12-07 10:38:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:00,501 INFO L93 Difference]: Finished difference Result 89520 states and 280849 transitions. [2019-12-07 10:38:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:38:00,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 10:38:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:00,637 INFO L225 Difference]: With dead ends: 89520 [2019-12-07 10:38:00,638 INFO L226 Difference]: Without dead ends: 89501 [2019-12-07 10:38:00,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:38:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89501 states. [2019-12-07 10:38:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89501 to 51874. [2019-12-07 10:38:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51874 states. [2019-12-07 10:38:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51874 states to 51874 states and 162887 transitions. [2019-12-07 10:38:01,795 INFO L78 Accepts]: Start accepts. Automaton has 51874 states and 162887 transitions. Word has length 27 [2019-12-07 10:38:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:01,795 INFO L462 AbstractCegarLoop]: Abstraction has 51874 states and 162887 transitions. [2019-12-07 10:38:01,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:38:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 51874 states and 162887 transitions. [2019-12-07 10:38:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:38:01,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:01,811 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 10:38:01,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash -665356316, now seen corresponding path program 1 times [2019-12-07 10:38:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:01,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804116467] [2019-12-07 10:38:01,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:01,866 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 10:38:01,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804116467] [2019-12-07 10:38:01,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:01,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:38:01,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165820722] [2019-12-07 10:38:01,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:38:01,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:38:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:38:01,867 INFO L87 Difference]: Start difference. First operand 51874 states and 162887 transitions. Second operand 5 states. [2019-12-07 10:38:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:02,419 INFO L93 Difference]: Finished difference Result 71552 states and 222438 transitions. [2019-12-07 10:38:02,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:38:02,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:38:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:02,521 INFO L225 Difference]: With dead ends: 71552 [2019-12-07 10:38:02,522 INFO L226 Difference]: Without dead ends: 71552 [2019-12-07 10:38:02,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:38:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71552 states. [2019-12-07 10:38:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71552 to 62228. [2019-12-07 10:38:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62228 states. [2019-12-07 10:38:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62228 states to 62228 states and 195110 transitions. [2019-12-07 10:38:03,636 INFO L78 Accepts]: Start accepts. Automaton has 62228 states and 195110 transitions. Word has length 28 [2019-12-07 10:38:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:03,636 INFO L462 AbstractCegarLoop]: Abstraction has 62228 states and 195110 transitions. [2019-12-07 10:38:03,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:38:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 62228 states and 195110 transitions. [2019-12-07 10:38:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:38:03,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:03,660 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 10:38:03,660 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-07 10:38:03,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:03,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783809882] [2019-12-07 10:38:03,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:03,705 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 10:38:03,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783809882] [2019-12-07 10:38:03,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:03,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:38:03,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627477389] [2019-12-07 10:38:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:38:03,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:38:03,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:38:03,706 INFO L87 Difference]: Start difference. First operand 62228 states and 195110 transitions. Second operand 6 states. [2019-12-07 10:38:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:04,320 INFO L93 Difference]: Finished difference Result 100378 states and 313238 transitions. [2019-12-07 10:38:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:38:04,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 10:38:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:04,480 INFO L225 Difference]: With dead ends: 100378 [2019-12-07 10:38:04,480 INFO L226 Difference]: Without dead ends: 100356 [2019-12-07 10:38:04,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:38:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100356 states. [2019-12-07 10:38:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100356 to 62116. [2019-12-07 10:38:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62116 states. [2019-12-07 10:38:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62116 states to 62116 states and 194655 transitions. [2019-12-07 10:38:05,808 INFO L78 Accepts]: Start accepts. Automaton has 62116 states and 194655 transitions. Word has length 28 [2019-12-07 10:38:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:05,809 INFO L462 AbstractCegarLoop]: Abstraction has 62116 states and 194655 transitions. [2019-12-07 10:38:05,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:38:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 62116 states and 194655 transitions. [2019-12-07 10:38:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:38:05,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:05,826 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 10:38:05,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1921906081, now seen corresponding path program 1 times [2019-12-07 10:38:05,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685995970] [2019-12-07 10:38:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:38:05,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685995970] [2019-12-07 10:38:05,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:05,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:38:05,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606195570] [2019-12-07 10:38:05,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:38:05,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:05,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:38:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:38:05,991 INFO L87 Difference]: Start difference. First operand 62116 states and 194655 transitions. Second operand 4 states. [2019-12-07 10:38:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:06,068 INFO L93 Difference]: Finished difference Result 27259 states and 80638 transitions. [2019-12-07 10:38:06,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:38:06,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 10:38:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:06,099 INFO L225 Difference]: With dead ends: 27259 [2019-12-07 10:38:06,100 INFO L226 Difference]: Without dead ends: 27259 [2019-12-07 10:38:06,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:38:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27259 states. [2019-12-07 10:38:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27259 to 25340. [2019-12-07 10:38:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25340 states. [2019-12-07 10:38:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25340 states to 25340 states and 75051 transitions. [2019-12-07 10:38:06,452 INFO L78 Accepts]: Start accepts. Automaton has 25340 states and 75051 transitions. Word has length 29 [2019-12-07 10:38:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:06,453 INFO L462 AbstractCegarLoop]: Abstraction has 25340 states and 75051 transitions. [2019-12-07 10:38:06,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:38:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 25340 states and 75051 transitions. [2019-12-07 10:38:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:38:06,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:06,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:06,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-07 10:38:06,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113219918] [2019-12-07 10:38:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:06,525 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 10:38:06,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113219918] [2019-12-07 10:38:06,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:06,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:38:06,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568939592] [2019-12-07 10:38:06,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:38:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:38:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:38:06,526 INFO L87 Difference]: Start difference. First operand 25340 states and 75051 transitions. Second operand 7 states. [2019-12-07 10:38:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:07,243 INFO L93 Difference]: Finished difference Result 48894 states and 143229 transitions. [2019-12-07 10:38:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:38:07,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 10:38:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:07,298 INFO L225 Difference]: With dead ends: 48894 [2019-12-07 10:38:07,298 INFO L226 Difference]: Without dead ends: 48894 [2019-12-07 10:38:07,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:38:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48894 states. [2019-12-07 10:38:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48894 to 27097. [2019-12-07 10:38:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27097 states. [2019-12-07 10:38:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27097 states to 27097 states and 80335 transitions. [2019-12-07 10:38:07,847 INFO L78 Accepts]: Start accepts. Automaton has 27097 states and 80335 transitions. Word has length 33 [2019-12-07 10:38:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:07,847 INFO L462 AbstractCegarLoop]: Abstraction has 27097 states and 80335 transitions. [2019-12-07 10:38:07,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:38:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27097 states and 80335 transitions. [2019-12-07 10:38:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:38:07,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:07,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:07,866 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-07 10:38:07,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:07,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587027242] [2019-12-07 10:38:07,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:07,929 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 10:38:07,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587027242] [2019-12-07 10:38:07,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:07,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:38:07,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390053650] [2019-12-07 10:38:07,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:38:07,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:38:07,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:38:07,930 INFO L87 Difference]: Start difference. First operand 27097 states and 80335 transitions. Second operand 8 states. [2019-12-07 10:38:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:09,108 INFO L93 Difference]: Finished difference Result 59558 states and 172804 transitions. [2019-12-07 10:38:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:38:09,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 10:38:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:09,193 INFO L225 Difference]: With dead ends: 59558 [2019-12-07 10:38:09,194 INFO L226 Difference]: Without dead ends: 59558 [2019-12-07 10:38:09,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:38:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59558 states. [2019-12-07 10:38:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59558 to 26677. [2019-12-07 10:38:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26677 states. [2019-12-07 10:38:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26677 states to 26677 states and 79067 transitions. [2019-12-07 10:38:09,829 INFO L78 Accepts]: Start accepts. Automaton has 26677 states and 79067 transitions. Word has length 33 [2019-12-07 10:38:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:09,829 INFO L462 AbstractCegarLoop]: Abstraction has 26677 states and 79067 transitions. [2019-12-07 10:38:09,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:38:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 26677 states and 79067 transitions. [2019-12-07 10:38:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:38:09,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:09,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] [2019-12-07 10:38:09,850 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-07 10:38:09,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:09,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786560977] [2019-12-07 10:38:09,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:09,911 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 10:38:09,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786560977] [2019-12-07 10:38:09,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:09,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:38:09,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169846826] [2019-12-07 10:38:09,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:38:09,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:38:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:38:09,912 INFO L87 Difference]: Start difference. First operand 26677 states and 79067 transitions. Second operand 7 states. [2019-12-07 10:38:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:10,683 INFO L93 Difference]: Finished difference Result 46210 states and 134901 transitions. [2019-12-07 10:38:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:38:10,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 10:38:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:10,735 INFO L225 Difference]: With dead ends: 46210 [2019-12-07 10:38:10,735 INFO L226 Difference]: Without dead ends: 46210 [2019-12-07 10:38:10,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:38:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46210 states. [2019-12-07 10:38:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46210 to 26002. [2019-12-07 10:38:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26002 states. [2019-12-07 10:38:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26002 states to 26002 states and 77049 transitions. [2019-12-07 10:38:11,288 INFO L78 Accepts]: Start accepts. Automaton has 26002 states and 77049 transitions. Word has length 34 [2019-12-07 10:38:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:11,288 INFO L462 AbstractCegarLoop]: Abstraction has 26002 states and 77049 transitions. [2019-12-07 10:38:11,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:38:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26002 states and 77049 transitions. [2019-12-07 10:38:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:38:11,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:11,306 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] [2019-12-07 10:38:11,306 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-07 10:38:11,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:11,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136476029] [2019-12-07 10:38:11,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:11,369 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 10:38:11,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136476029] [2019-12-07 10:38:11,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:11,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:38:11,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474041541] [2019-12-07 10:38:11,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:38:11,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:38:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:38:11,371 INFO L87 Difference]: Start difference. First operand 26002 states and 77049 transitions. Second operand 7 states. [2019-12-07 10:38:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:12,171 INFO L93 Difference]: Finished difference Result 59306 states and 171456 transitions. [2019-12-07 10:38:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:38:12,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 10:38:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:12,242 INFO L225 Difference]: With dead ends: 59306 [2019-12-07 10:38:12,242 INFO L226 Difference]: Without dead ends: 59306 [2019-12-07 10:38:12,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:38:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59306 states. [2019-12-07 10:38:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59306 to 25630. [2019-12-07 10:38:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25630 states. [2019-12-07 10:38:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25630 states to 25630 states and 75894 transitions. [2019-12-07 10:38:12,845 INFO L78 Accepts]: Start accepts. Automaton has 25630 states and 75894 transitions. Word has length 34 [2019-12-07 10:38:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:12,845 INFO L462 AbstractCegarLoop]: Abstraction has 25630 states and 75894 transitions. [2019-12-07 10:38:12,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:38:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 25630 states and 75894 transitions. [2019-12-07 10:38:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:38:12,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:12,862 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] [2019-12-07 10:38:12,862 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-07 10:38:12,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:12,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628113828] [2019-12-07 10:38:12,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:12,940 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 10:38:12,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628113828] [2019-12-07 10:38:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:12,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:38:12,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274241396] [2019-12-07 10:38:12,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:38:12,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:38:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:38:12,941 INFO L87 Difference]: Start difference. First operand 25630 states and 75894 transitions. Second operand 8 states. [2019-12-07 10:38:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:14,126 INFO L93 Difference]: Finished difference Result 53210 states and 153684 transitions. [2019-12-07 10:38:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:38:14,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 10:38:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:14,192 INFO L225 Difference]: With dead ends: 53210 [2019-12-07 10:38:14,192 INFO L226 Difference]: Without dead ends: 53210 [2019-12-07 10:38:14,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:38:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53210 states. [2019-12-07 10:38:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53210 to 24741. [2019-12-07 10:38:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24741 states. [2019-12-07 10:38:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24741 states to 24741 states and 73197 transitions. [2019-12-07 10:38:14,763 INFO L78 Accepts]: Start accepts. Automaton has 24741 states and 73197 transitions. Word has length 34 [2019-12-07 10:38:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:14,763 INFO L462 AbstractCegarLoop]: Abstraction has 24741 states and 73197 transitions. [2019-12-07 10:38:14,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:38:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 24741 states and 73197 transitions. [2019-12-07 10:38:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:38:14,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:14,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:14,783 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586821, now seen corresponding path program 1 times [2019-12-07 10:38:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697963477] [2019-12-07 10:38:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:14,816 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 10:38:14,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697963477] [2019-12-07 10:38:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:14,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:38:14,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539144702] [2019-12-07 10:38:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:38:14,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:38:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:38:14,817 INFO L87 Difference]: Start difference. First operand 24741 states and 73197 transitions. Second operand 5 states. [2019-12-07 10:38:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:14,878 INFO L93 Difference]: Finished difference Result 23139 states and 69609 transitions. [2019-12-07 10:38:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:38:14,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 10:38:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:14,902 INFO L225 Difference]: With dead ends: 23139 [2019-12-07 10:38:14,903 INFO L226 Difference]: Without dead ends: 23139 [2019-12-07 10:38:14,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:38:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23139 states. [2019-12-07 10:38:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23139 to 20553. [2019-12-07 10:38:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20553 states. [2019-12-07 10:38:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20553 states to 20553 states and 62291 transitions. [2019-12-07 10:38:15,212 INFO L78 Accepts]: Start accepts. Automaton has 20553 states and 62291 transitions. Word has length 39 [2019-12-07 10:38:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:15,212 INFO L462 AbstractCegarLoop]: Abstraction has 20553 states and 62291 transitions. [2019-12-07 10:38:15,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:38:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 20553 states and 62291 transitions. [2019-12-07 10:38:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 10:38:15,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:15,231 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:15,232 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-07 10:38:15,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:15,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566183808] [2019-12-07 10:38:15,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:15,277 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 10:38:15,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566183808] [2019-12-07 10:38:15,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:15,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:38:15,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785371666] [2019-12-07 10:38:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:38:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:38:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:38:15,279 INFO L87 Difference]: Start difference. First operand 20553 states and 62291 transitions. Second operand 3 states. [2019-12-07 10:38:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:15,369 INFO L93 Difference]: Finished difference Result 25265 states and 76576 transitions. [2019-12-07 10:38:15,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:15,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-07 10:38:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:15,399 INFO L225 Difference]: With dead ends: 25265 [2019-12-07 10:38:15,399 INFO L226 Difference]: Without dead ends: 25265 [2019-12-07 10:38:15,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:38:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25265 states. [2019-12-07 10:38:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25265 to 21114. [2019-12-07 10:38:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21114 states. [2019-12-07 10:38:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21114 states to 21114 states and 64341 transitions. [2019-12-07 10:38:15,730 INFO L78 Accepts]: Start accepts. Automaton has 21114 states and 64341 transitions. Word has length 64 [2019-12-07 10:38:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:15,730 INFO L462 AbstractCegarLoop]: Abstraction has 21114 states and 64341 transitions. [2019-12-07 10:38:15,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:38:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21114 states and 64341 transitions. [2019-12-07 10:38:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:38:15,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:15,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:15,750 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-07 10:38:15,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:15,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454310902] [2019-12-07 10:38:15,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:38:15,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454310902] [2019-12-07 10:38:15,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:15,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:38:15,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884456987] [2019-12-07 10:38:15,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:38:15,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:38:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:38:15,784 INFO L87 Difference]: Start difference. First operand 21114 states and 64341 transitions. Second operand 3 states. [2019-12-07 10:38:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:15,945 INFO L93 Difference]: Finished difference Result 29049 states and 89039 transitions. [2019-12-07 10:38:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:15,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:38:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:15,978 INFO L225 Difference]: With dead ends: 29049 [2019-12-07 10:38:15,978 INFO L226 Difference]: Without dead ends: 29049 [2019-12-07 10:38:15,978 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 10:38:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29049 states. [2019-12-07 10:38:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29049 to 21600. [2019-12-07 10:38:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-12-07 10:38:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 65996 transitions. [2019-12-07 10:38:16,328 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 65996 transitions. Word has length 65 [2019-12-07 10:38:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:16,328 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 65996 transitions. [2019-12-07 10:38:16,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:38:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 65996 transitions. [2019-12-07 10:38:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:38:16,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:16,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:16,348 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-07 10:38:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:16,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698845042] [2019-12-07 10:38:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:16,426 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 10:38:16,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698845042] [2019-12-07 10:38:16,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:16,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:38:16,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127677440] [2019-12-07 10:38:16,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:38:16,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:38:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:38:16,427 INFO L87 Difference]: Start difference. First operand 21600 states and 65996 transitions. Second operand 7 states. [2019-12-07 10:38:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:18,251 INFO L93 Difference]: Finished difference Result 38432 states and 114872 transitions. [2019-12-07 10:38:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:38:18,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 10:38:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:18,294 INFO L225 Difference]: With dead ends: 38432 [2019-12-07 10:38:18,295 INFO L226 Difference]: Without dead ends: 38432 [2019-12-07 10:38:18,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:38:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-07 10:38:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 22439. [2019-12-07 10:38:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22439 states. [2019-12-07 10:38:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22439 states to 22439 states and 68497 transitions. [2019-12-07 10:38:18,743 INFO L78 Accepts]: Start accepts. Automaton has 22439 states and 68497 transitions. Word has length 65 [2019-12-07 10:38:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:18,743 INFO L462 AbstractCegarLoop]: Abstraction has 22439 states and 68497 transitions. [2019-12-07 10:38:18,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:38:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 22439 states and 68497 transitions. [2019-12-07 10:38:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:38:18,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:18,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:18,763 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -762976443, now seen corresponding path program 1 times [2019-12-07 10:38:18,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:18,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003614240] [2019-12-07 10:38:18,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:18,800 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 10:38:18,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003614240] [2019-12-07 10:38:18,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:18,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:38:18,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611220307] [2019-12-07 10:38:18,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:38:18,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:38:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:38:18,802 INFO L87 Difference]: Start difference. First operand 22439 states and 68497 transitions. Second operand 3 states. [2019-12-07 10:38:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:18,857 INFO L93 Difference]: Finished difference Result 22439 states and 68496 transitions. [2019-12-07 10:38:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:18,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:38:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:18,882 INFO L225 Difference]: With dead ends: 22439 [2019-12-07 10:38:18,882 INFO L226 Difference]: Without dead ends: 22439 [2019-12-07 10:38:18,882 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 10:38:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22439 states. [2019-12-07 10:38:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22439 to 17548. [2019-12-07 10:38:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-12-07 10:38:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 54575 transitions. [2019-12-07 10:38:19,157 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 54575 transitions. Word has length 65 [2019-12-07 10:38:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:19,157 INFO L462 AbstractCegarLoop]: Abstraction has 17548 states and 54575 transitions. [2019-12-07 10:38:19,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:38:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 54575 transitions. [2019-12-07 10:38:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:38:19,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:19,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:19,172 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1104317856, now seen corresponding path program 1 times [2019-12-07 10:38:19,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:19,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32983257] [2019-12-07 10:38:19,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:19,430 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 10:38:19,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32983257] [2019-12-07 10:38:19,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:19,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:38:19,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254644687] [2019-12-07 10:38:19,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:38:19,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:38:19,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:38:19,431 INFO L87 Difference]: Start difference. First operand 17548 states and 54575 transitions. Second operand 14 states. [2019-12-07 10:38:22,111 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 10:38:22,972 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 10:38:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:32,748 INFO L93 Difference]: Finished difference Result 168328 states and 508186 transitions. [2019-12-07 10:38:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-07 10:38:32,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-07 10:38:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:32,939 INFO L225 Difference]: With dead ends: 168328 [2019-12-07 10:38:32,939 INFO L226 Difference]: Without dead ends: 137875 [2019-12-07 10:38:32,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5672 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1913, Invalid=12367, Unknown=0, NotChecked=0, Total=14280 [2019-12-07 10:38:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137875 states. [2019-12-07 10:38:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137875 to 22011. [2019-12-07 10:38:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22011 states. [2019-12-07 10:38:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22011 states to 22011 states and 69132 transitions. [2019-12-07 10:38:34,131 INFO L78 Accepts]: Start accepts. Automaton has 22011 states and 69132 transitions. Word has length 66 [2019-12-07 10:38:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:34,132 INFO L462 AbstractCegarLoop]: Abstraction has 22011 states and 69132 transitions. [2019-12-07 10:38:34,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:38:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22011 states and 69132 transitions. [2019-12-07 10:38:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:38:34,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:34,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:34,153 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:34,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:34,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1696115389, now seen corresponding path program 1 times [2019-12-07 10:38:34,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:34,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255419629] [2019-12-07 10:38:34,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:34,196 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 10:38:34,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255419629] [2019-12-07 10:38:34,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:34,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:38:34,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098233050] [2019-12-07 10:38:34,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:38:34,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:34,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:38:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:38:34,197 INFO L87 Difference]: Start difference. First operand 22011 states and 69132 transitions. Second operand 4 states. [2019-12-07 10:38:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:34,300 INFO L93 Difference]: Finished difference Result 21819 states and 68336 transitions. [2019-12-07 10:38:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:38:34,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 10:38:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:34,327 INFO L225 Difference]: With dead ends: 21819 [2019-12-07 10:38:34,327 INFO L226 Difference]: Without dead ends: 21819 [2019-12-07 10:38:34,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 10:38:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2019-12-07 10:38:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 19556. [2019-12-07 10:38:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19556 states. [2019-12-07 10:38:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19556 states to 19556 states and 61094 transitions. [2019-12-07 10:38:34,630 INFO L78 Accepts]: Start accepts. Automaton has 19556 states and 61094 transitions. Word has length 66 [2019-12-07 10:38:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:34,630 INFO L462 AbstractCegarLoop]: Abstraction has 19556 states and 61094 transitions. [2019-12-07 10:38:34,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:38:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19556 states and 61094 transitions. [2019-12-07 10:38:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:38:34,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:34,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:34,648 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1878033462, now seen corresponding path program 2 times [2019-12-07 10:38:34,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:34,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868630418] [2019-12-07 10:38:34,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:34,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 10:38:34,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868630418] [2019-12-07 10:38:34,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:34,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:38:34,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115946718] [2019-12-07 10:38:34,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:38:34,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:38:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:38:34,693 INFO L87 Difference]: Start difference. First operand 19556 states and 61094 transitions. Second operand 3 states. [2019-12-07 10:38:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:34,764 INFO L93 Difference]: Finished difference Result 19556 states and 59986 transitions. [2019-12-07 10:38:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:34,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:38:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:34,791 INFO L225 Difference]: With dead ends: 19556 [2019-12-07 10:38:34,791 INFO L226 Difference]: Without dead ends: 19556 [2019-12-07 10:38:34,791 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 10:38:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19556 states. [2019-12-07 10:38:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19556 to 18770. [2019-12-07 10:38:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18770 states. [2019-12-07 10:38:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18770 states to 18770 states and 57743 transitions. [2019-12-07 10:38:35,089 INFO L78 Accepts]: Start accepts. Automaton has 18770 states and 57743 transitions. Word has length 66 [2019-12-07 10:38:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:35,089 INFO L462 AbstractCegarLoop]: Abstraction has 18770 states and 57743 transitions. [2019-12-07 10:38:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:38:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18770 states and 57743 transitions. [2019-12-07 10:38:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:38:35,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:35,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:35,105 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:35,105 INFO L82 PathProgramCache]: Analyzing trace with hash 625040777, now seen corresponding path program 1 times [2019-12-07 10:38:35,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:35,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322858747] [2019-12-07 10:38:35,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:35,568 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 10:38:35,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322858747] [2019-12-07 10:38:35,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:35,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 10:38:35,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348806396] [2019-12-07 10:38:35,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:38:35,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:38:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:38:35,569 INFO L87 Difference]: Start difference. First operand 18770 states and 57743 transitions. Second operand 19 states. [2019-12-07 10:38:38,756 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 10:38:40,067 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 10:38:40,717 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 10:38:41,241 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 10:38:50,367 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-07 10:38:52,773 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 10:38:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:54,316 INFO L93 Difference]: Finished difference Result 90184 states and 275188 transitions. [2019-12-07 10:38:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-12-07 10:38:54,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-07 10:38:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:54,420 INFO L225 Difference]: With dead ends: 90184 [2019-12-07 10:38:54,420 INFO L226 Difference]: Without dead ends: 83495 [2019-12-07 10:38:54,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11522 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3353, Invalid=25377, Unknown=0, NotChecked=0, Total=28730 [2019-12-07 10:38:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83495 states. [2019-12-07 10:38:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83495 to 18763. [2019-12-07 10:38:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18763 states. [2019-12-07 10:38:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18763 states to 18763 states and 57577 transitions. [2019-12-07 10:38:55,173 INFO L78 Accepts]: Start accepts. Automaton has 18763 states and 57577 transitions. Word has length 67 [2019-12-07 10:38:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:55,173 INFO L462 AbstractCegarLoop]: Abstraction has 18763 states and 57577 transitions. [2019-12-07 10:38:55,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:38:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18763 states and 57577 transitions. [2019-12-07 10:38:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:38:55,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:55,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:55,191 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1060006711, now seen corresponding path program 2 times [2019-12-07 10:38:55,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:55,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308517984] [2019-12-07 10:38:55,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:55,295 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 10:38:55,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308517984] [2019-12-07 10:38:55,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:55,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:38:55,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188134237] [2019-12-07 10:38:55,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:38:55,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:38:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:38:55,297 INFO L87 Difference]: Start difference. First operand 18763 states and 57577 transitions. Second operand 9 states. [2019-12-07 10:38:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:56,869 INFO L93 Difference]: Finished difference Result 121312 states and 362487 transitions. [2019-12-07 10:38:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 10:38:56,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 10:38:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:57,021 INFO L225 Difference]: With dead ends: 121312 [2019-12-07 10:38:57,021 INFO L226 Difference]: Without dead ends: 116290 [2019-12-07 10:38:57,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 10:38:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116290 states. [2019-12-07 10:38:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116290 to 18625. [2019-12-07 10:38:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18625 states. [2019-12-07 10:38:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18625 states to 18625 states and 57239 transitions. [2019-12-07 10:38:57,988 INFO L78 Accepts]: Start accepts. Automaton has 18625 states and 57239 transitions. Word has length 67 [2019-12-07 10:38:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:57,989 INFO L462 AbstractCegarLoop]: Abstraction has 18625 states and 57239 transitions. [2019-12-07 10:38:57,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:38:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18625 states and 57239 transitions. [2019-12-07 10:38:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:38:58,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:58,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:58,006 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash 579351643, now seen corresponding path program 3 times [2019-12-07 10:38:58,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:58,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338589630] [2019-12-07 10:38:58,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:58,084 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 10:38:58,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338589630] [2019-12-07 10:38:58,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:58,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:38:58,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109969445] [2019-12-07 10:38:58,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:38:58,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:38:58,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:38:58,086 INFO L87 Difference]: Start difference. First operand 18625 states and 57239 transitions. Second operand 9 states. [2019-12-07 10:38:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:59,042 INFO L93 Difference]: Finished difference Result 81596 states and 240412 transitions. [2019-12-07 10:38:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 10:38:59,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 10:38:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:59,105 INFO L225 Difference]: With dead ends: 81596 [2019-12-07 10:38:59,106 INFO L226 Difference]: Without dead ends: 57540 [2019-12-07 10:38:59,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:38:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57540 states. [2019-12-07 10:38:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57540 to 19841. [2019-12-07 10:38:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19841 states. [2019-12-07 10:38:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19841 states to 19841 states and 60434 transitions. [2019-12-07 10:38:59,634 INFO L78 Accepts]: Start accepts. Automaton has 19841 states and 60434 transitions. Word has length 67 [2019-12-07 10:38:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:59,634 INFO L462 AbstractCegarLoop]: Abstraction has 19841 states and 60434 transitions. [2019-12-07 10:38:59,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:38:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 19841 states and 60434 transitions. [2019-12-07 10:38:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:38:59,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:59,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:59,652 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:38:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 4 times [2019-12-07 10:38:59,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:59,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253347515] [2019-12-07 10:38:59,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:38:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:38:59,732 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:38:59,732 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:38:59,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55|) |v_ULTIMATE.start_main_~#t1111~0.offset_34| 0))) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_34|) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1111~0.base_55|) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55|)) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55| 1) |v_#valid_91|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_41|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_55|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_20|, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_19|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_28|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_34|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 10:38:59,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~x~0_In349181556 ~__unbuffered_p0_EAX~0_Out349181556) (= ~a$r_buff1_thd1~0_Out349181556 ~a$r_buff0_thd1~0_In349181556) (= ~a$r_buff1_thd3~0_Out349181556 ~a$r_buff0_thd3~0_In349181556) (= 1 ~a$r_buff0_thd1~0_Out349181556) (= ~a$r_buff0_thd0~0_In349181556 ~a$r_buff1_thd0~0_Out349181556) (= ~a$r_buff0_thd2~0_In349181556 ~a$r_buff1_thd2~0_Out349181556) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In349181556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In349181556, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In349181556, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In349181556, ~x~0=~x~0_In349181556} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out349181556, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out349181556, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out349181556, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out349181556, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out349181556, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In349181556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In349181556, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out349181556, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In349181556, ~x~0=~x~0_In349181556} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:38:59,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:38:59,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-07 10:38:59,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| |P1Thread1of1ForFork2_#t~ite10_Out-1926187351|)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1926187351 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1926187351 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| ~a$w_buff1~0_In-1926187351) (not .cse1) (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| ~a~0_In-1926187351) .cse0 (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-1926187351, ~a$w_buff1~0=~a$w_buff1~0_In-1926187351, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} OutVars{~a~0=~a~0_In-1926187351, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1926187351|, ~a$w_buff1~0=~a$w_buff1~0_In-1926187351, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1926187351|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 10:38:59,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1706967291 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1706967291 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1706967291 |P1Thread1of1ForFork2_#t~ite11_Out1706967291|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1706967291|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1706967291|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:38:59,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1995230310 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1995230310 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1995230310 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1995230310 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1995230310| ~a$w_buff1_used~0_In-1995230310) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1995230310| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1995230310, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1995230310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1995230310} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1995230310, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1995230310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1995230310|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1995230310} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 10:38:59,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1941841714 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1941841714| ~a$w_buff0~0_In-1941841714) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1941841714 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1941841714 256))) (= 0 (mod ~a$w_buff0_used~0_In-1941841714 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1941841714 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1941841714| |P2Thread1of1ForFork0_#t~ite20_Out-1941841714|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1941841714| ~a$w_buff0~0_In-1941841714) (= |P2Thread1of1ForFork0_#t~ite20_In-1941841714| |P2Thread1of1ForFork0_#t~ite20_Out-1941841714|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1941841714, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1941841714, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941841714, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1941841714, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941841714, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1941841714|, ~weak$$choice2~0=~weak$$choice2~0_In-1941841714} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1941841714|, ~a$w_buff0~0=~a$w_buff0~0_In-1941841714, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1941841714, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941841714, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1941841714, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1941841714|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941841714, ~weak$$choice2~0=~weak$$choice2~0_In-1941841714} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 10:38:59,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1874759995 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1874759995 256)))) (or (and (= ~a$r_buff0_thd2~0_In-1874759995 |P1Thread1of1ForFork2_#t~ite13_Out-1874759995|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1874759995|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1874759995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874759995} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1874759995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874759995, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1874759995|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 10:38:59,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1909038171 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1909038171 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1909038171 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1909038171 256)))) (or (and (= ~a$r_buff1_thd2~0_In1909038171 |P1Thread1of1ForFork2_#t~ite14_Out1909038171|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1909038171|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1909038171, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1909038171, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1909038171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1909038171} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1909038171, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1909038171, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1909038171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1909038171, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1909038171|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:38:59,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_48| v_~a$r_buff1_thd2~0_119) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_48|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_47|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:38:59,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In288036537 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out288036537| ~a$w_buff1~0_In288036537) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In288036537 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In288036537 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In288036537 256) 0) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In288036537 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out288036537| |P2Thread1of1ForFork0_#t~ite24_Out288036537|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In288036537| |P2Thread1of1ForFork0_#t~ite23_Out288036537|) (= ~a$w_buff1~0_In288036537 |P2Thread1of1ForFork0_#t~ite24_Out288036537|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In288036537, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In288036537|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In288036537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In288036537, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In288036537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In288036537, ~weak$$choice2~0=~weak$$choice2~0_In288036537} OutVars{~a$w_buff1~0=~a$w_buff1~0_In288036537, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out288036537|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out288036537|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In288036537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In288036537, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In288036537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In288036537, ~weak$$choice2~0=~weak$$choice2~0_In288036537} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 10:38:59,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-191732159 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-191732159| ~a$w_buff0_used~0_In-191732159) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-191732159| |P2Thread1of1ForFork0_#t~ite26_Out-191732159|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-191732159| |P2Thread1of1ForFork0_#t~ite26_Out-191732159|) (= ~a$w_buff0_used~0_In-191732159 |P2Thread1of1ForFork0_#t~ite26_Out-191732159|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-191732159 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-191732159 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-191732159 256) 0)) (= (mod ~a$w_buff0_used~0_In-191732159 256) 0)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-191732159|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-191732159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191732159, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-191732159, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-191732159, ~weak$$choice2~0=~weak$$choice2~0_In-191732159} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-191732159|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-191732159|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-191732159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191732159, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-191732159, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-191732159, ~weak$$choice2~0=~weak$$choice2~0_In-191732159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 10:38:59,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:38:59,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 10:38:59,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-173599437 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-173599437 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-173599437| ~a~0_In-173599437)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-173599437| ~a$w_buff1~0_In-173599437)))) InVars {~a~0=~a~0_In-173599437, ~a$w_buff1~0=~a$w_buff1~0_In-173599437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} OutVars{~a~0=~a~0_In-173599437, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-173599437|, ~a$w_buff1~0=~a$w_buff1~0_In-173599437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:38:59,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:38:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1862723606 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1862723606 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1862723606 |P2Thread1of1ForFork0_#t~ite40_Out-1862723606|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1862723606|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862723606, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1862723606} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1862723606|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862723606, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1862723606} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 10:38:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1468227250 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1468227250 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1468227250| 0)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1468227250 |P0Thread1of1ForFork1_#t~ite5_Out1468227250|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1468227250} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1468227250|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1468227250} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 10:38:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-2122992542 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2122992542 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-2122992542 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2122992542 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2122992542|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-2122992542 |P0Thread1of1ForFork1_#t~ite6_Out-2122992542|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2122992542, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122992542, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2122992542|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2122992542, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122992542, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 10:38:59,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_In2076576049 ~a$r_buff0_thd1~0_Out2076576049)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2076576049 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In2076576049 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~a$r_buff0_thd1~0_Out2076576049) (not .cse1) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2076576049} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2076576049|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2076576049} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:38:59,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-992523873 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-992523873 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-992523873 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-992523873 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-992523873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-992523873| ~a$r_buff1_thd1~0_In-992523873) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-992523873, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-992523873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-992523873, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-992523873} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-992523873|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-992523873, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-992523873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-992523873, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-992523873} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 10:38:59,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_25|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:38:59,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1985926963 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1985926963 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1985926963 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1985926963 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1985926963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1985926963 |P2Thread1of1ForFork0_#t~ite41_Out1985926963|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1985926963|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 10:38:59,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1641401823 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1641401823 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1641401823| ~a$r_buff0_thd3~0_In-1641401823)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1641401823| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641401823, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1641401823} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641401823, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1641401823, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1641401823|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:38:59,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In196223387 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In196223387 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In196223387 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In196223387 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out196223387| ~a$r_buff1_thd3~0_In196223387)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite43_Out196223387| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196223387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In196223387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In196223387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196223387} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out196223387|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196223387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In196223387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In196223387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196223387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 10:38:59,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_28|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:38:59,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_24) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:38:59,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-988206060| |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-988206060 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-988206060 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (and .cse0 (= ~a~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} OutVars{~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-988206060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-988206060|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:38:59,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-95934758 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-95934758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-95934758| ~a$w_buff0_used~0_In-95934758) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-95934758|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-95934758|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:38:59,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In1886088361 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1886088361 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1886088361 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1886088361 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1886088361| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out1886088361| ~a$w_buff1_used~0_In1886088361) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1886088361, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1886088361, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1886088361} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1886088361|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1886088361, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1886088361, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1886088361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:38:59,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1344516699 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1344516699 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1344516699 |ULTIMATE.start_main_#t~ite51_Out-1344516699|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1344516699|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344516699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1344516699} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1344516699|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344516699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1344516699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:38:59,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1864526349 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1864526349 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1864526349 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1864526349 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1864526349| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1864526349| ~a$r_buff1_thd0~0_In-1864526349) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1864526349, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1864526349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1864526349} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1864526349|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1864526349, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1864526349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1864526349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:38:59,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:38:59,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:38:59 BasicIcfg [2019-12-07 10:38:59,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:38:59,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:38:59,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:38:59,801 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:38:59,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:37:00" (3/4) ... [2019-12-07 10:38:59,803 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:38:59,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55|) |v_ULTIMATE.start_main_~#t1111~0.offset_34| 0))) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_34|) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1111~0.base_55|) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55|)) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55| 1) |v_#valid_91|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_41|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_55|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_20|, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_19|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_28|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_34|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 10:38:59,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~x~0_In349181556 ~__unbuffered_p0_EAX~0_Out349181556) (= ~a$r_buff1_thd1~0_Out349181556 ~a$r_buff0_thd1~0_In349181556) (= ~a$r_buff1_thd3~0_Out349181556 ~a$r_buff0_thd3~0_In349181556) (= 1 ~a$r_buff0_thd1~0_Out349181556) (= ~a$r_buff0_thd0~0_In349181556 ~a$r_buff1_thd0~0_Out349181556) (= ~a$r_buff0_thd2~0_In349181556 ~a$r_buff1_thd2~0_Out349181556) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In349181556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In349181556, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In349181556, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In349181556, ~x~0=~x~0_In349181556} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out349181556, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out349181556, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out349181556, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out349181556, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out349181556, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In349181556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In349181556, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In349181556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out349181556, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In349181556, ~x~0=~x~0_In349181556} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:38:59,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:38:59,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-07 10:38:59,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| |P1Thread1of1ForFork2_#t~ite10_Out-1926187351|)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1926187351 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1926187351 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| ~a$w_buff1~0_In-1926187351) (not .cse1) (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1926187351| ~a~0_In-1926187351) .cse0 (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-1926187351, ~a$w_buff1~0=~a$w_buff1~0_In-1926187351, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} OutVars{~a~0=~a~0_In-1926187351, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1926187351|, ~a$w_buff1~0=~a$w_buff1~0_In-1926187351, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1926187351|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 10:38:59,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1706967291 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1706967291 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1706967291 |P1Thread1of1ForFork2_#t~ite11_Out1706967291|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1706967291|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1706967291|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:38:59,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1995230310 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1995230310 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1995230310 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1995230310 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1995230310| ~a$w_buff1_used~0_In-1995230310) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1995230310| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1995230310, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1995230310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1995230310} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1995230310, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1995230310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1995230310|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1995230310} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 10:38:59,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1941841714 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1941841714| ~a$w_buff0~0_In-1941841714) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1941841714 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1941841714 256))) (= 0 (mod ~a$w_buff0_used~0_In-1941841714 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1941841714 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1941841714| |P2Thread1of1ForFork0_#t~ite20_Out-1941841714|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1941841714| ~a$w_buff0~0_In-1941841714) (= |P2Thread1of1ForFork0_#t~ite20_In-1941841714| |P2Thread1of1ForFork0_#t~ite20_Out-1941841714|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1941841714, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1941841714, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941841714, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1941841714, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941841714, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1941841714|, ~weak$$choice2~0=~weak$$choice2~0_In-1941841714} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1941841714|, ~a$w_buff0~0=~a$w_buff0~0_In-1941841714, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1941841714, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941841714, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1941841714, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1941841714|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941841714, ~weak$$choice2~0=~weak$$choice2~0_In-1941841714} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 10:38:59,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1874759995 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1874759995 256)))) (or (and (= ~a$r_buff0_thd2~0_In-1874759995 |P1Thread1of1ForFork2_#t~ite13_Out-1874759995|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1874759995|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1874759995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874759995} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1874759995, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874759995, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1874759995|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 10:38:59,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1909038171 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1909038171 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1909038171 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1909038171 256)))) (or (and (= ~a$r_buff1_thd2~0_In1909038171 |P1Thread1of1ForFork2_#t~ite14_Out1909038171|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1909038171|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1909038171, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1909038171, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1909038171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1909038171} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1909038171, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1909038171, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1909038171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1909038171, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1909038171|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:38:59,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_48| v_~a$r_buff1_thd2~0_119) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_48|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_47|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:38:59,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In288036537 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out288036537| ~a$w_buff1~0_In288036537) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In288036537 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In288036537 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In288036537 256) 0) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In288036537 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out288036537| |P2Thread1of1ForFork0_#t~ite24_Out288036537|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In288036537| |P2Thread1of1ForFork0_#t~ite23_Out288036537|) (= ~a$w_buff1~0_In288036537 |P2Thread1of1ForFork0_#t~ite24_Out288036537|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In288036537, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In288036537|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In288036537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In288036537, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In288036537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In288036537, ~weak$$choice2~0=~weak$$choice2~0_In288036537} OutVars{~a$w_buff1~0=~a$w_buff1~0_In288036537, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out288036537|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out288036537|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In288036537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In288036537, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In288036537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In288036537, ~weak$$choice2~0=~weak$$choice2~0_In288036537} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 10:38:59,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-191732159 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-191732159| ~a$w_buff0_used~0_In-191732159) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-191732159| |P2Thread1of1ForFork0_#t~ite26_Out-191732159|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-191732159| |P2Thread1of1ForFork0_#t~ite26_Out-191732159|) (= ~a$w_buff0_used~0_In-191732159 |P2Thread1of1ForFork0_#t~ite26_Out-191732159|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-191732159 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-191732159 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-191732159 256) 0)) (= (mod ~a$w_buff0_used~0_In-191732159 256) 0)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-191732159|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-191732159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191732159, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-191732159, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-191732159, ~weak$$choice2~0=~weak$$choice2~0_In-191732159} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-191732159|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-191732159|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-191732159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-191732159, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-191732159, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-191732159, ~weak$$choice2~0=~weak$$choice2~0_In-191732159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 10:38:59,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:38:59,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 10:38:59,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-173599437 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-173599437 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-173599437| ~a~0_In-173599437)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-173599437| ~a$w_buff1~0_In-173599437)))) InVars {~a~0=~a~0_In-173599437, ~a$w_buff1~0=~a$w_buff1~0_In-173599437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} OutVars{~a~0=~a~0_In-173599437, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-173599437|, ~a$w_buff1~0=~a$w_buff1~0_In-173599437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:38:59,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:38:59,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1862723606 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1862723606 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1862723606 |P2Thread1of1ForFork0_#t~ite40_Out-1862723606|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1862723606|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862723606, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1862723606} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1862723606|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862723606, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1862723606} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 10:38:59,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1468227250 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1468227250 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1468227250| 0)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1468227250 |P0Thread1of1ForFork1_#t~ite5_Out1468227250|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1468227250} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1468227250|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1468227250} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 10:38:59,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-2122992542 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2122992542 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-2122992542 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2122992542 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2122992542|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-2122992542 |P0Thread1of1ForFork1_#t~ite6_Out-2122992542|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2122992542, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122992542, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2122992542|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2122992542, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122992542, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 10:38:59,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_In2076576049 ~a$r_buff0_thd1~0_Out2076576049)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2076576049 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In2076576049 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~a$r_buff0_thd1~0_Out2076576049) (not .cse1) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2076576049} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2076576049|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2076576049} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:38:59,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-992523873 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-992523873 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-992523873 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-992523873 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-992523873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-992523873| ~a$r_buff1_thd1~0_In-992523873) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-992523873, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-992523873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-992523873, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-992523873} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-992523873|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-992523873, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-992523873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-992523873, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-992523873} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 10:38:59,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_25|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:38:59,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1985926963 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1985926963 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1985926963 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1985926963 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1985926963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1985926963 |P2Thread1of1ForFork0_#t~ite41_Out1985926963|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1985926963|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 10:38:59,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1641401823 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1641401823 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1641401823| ~a$r_buff0_thd3~0_In-1641401823)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1641401823| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641401823, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1641401823} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641401823, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1641401823, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1641401823|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:38:59,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In196223387 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In196223387 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In196223387 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In196223387 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out196223387| ~a$r_buff1_thd3~0_In196223387)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite43_Out196223387| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196223387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In196223387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In196223387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196223387} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out196223387|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196223387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In196223387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In196223387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196223387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 10:38:59,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_28|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:38:59,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_24) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:38:59,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-988206060| |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-988206060 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-988206060 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (and .cse0 (= ~a~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} OutVars{~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-988206060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-988206060|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:38:59,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-95934758 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-95934758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-95934758| ~a$w_buff0_used~0_In-95934758) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-95934758|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-95934758|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:38:59,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In1886088361 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1886088361 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1886088361 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1886088361 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1886088361| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out1886088361| ~a$w_buff1_used~0_In1886088361) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1886088361, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1886088361, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1886088361} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1886088361|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1886088361, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1886088361, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1886088361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:38:59,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1344516699 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1344516699 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1344516699 |ULTIMATE.start_main_#t~ite51_Out-1344516699|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1344516699|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344516699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1344516699} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1344516699|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344516699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1344516699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:38:59,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1864526349 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1864526349 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1864526349 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1864526349 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1864526349| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1864526349| ~a$r_buff1_thd0~0_In-1864526349) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1864526349, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1864526349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1864526349} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1864526349|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1864526349, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1864526349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1864526349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:38:59,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:38:59,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e4eb0717-e404-497c-88b5-0882f46cf893/bin/utaipan/witness.graphml [2019-12-07 10:38:59,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:38:59,872 INFO L168 Benchmark]: Toolchain (without parser) took 120386.77 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 933.9 MB in the beginning and 4.0 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,872 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:38:59,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 933.9 MB in the beginning and 1.0 GB in the end (delta: -111.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,873 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:38:59,873 INFO L168 Benchmark]: RCFGBuilder took 416.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.1 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,873 INFO L168 Benchmark]: TraceAbstraction took 119459.08 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 986.1 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,873 INFO L168 Benchmark]: Witness Printer took 69.86 ms. Allocated memory is still 6.9 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:59,875 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 933.9 MB in the beginning and 1.0 GB in the end (delta: -111.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 986.1 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119459.08 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 986.1 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 69.86 ms. Allocated memory is still 6.9 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.2s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 54.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7598 SDtfs, 12472 SDslu, 23562 SDs, 0 SdLazy, 26349 SolverSat, 1179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 60 SyntacticMatches, 19 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18626 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172880occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 703740 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 290082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...