./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_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_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/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 3ac002b3633adb7e73afb8704d2ea9835992d8e2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:02:40,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:02:40,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:02:40,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:02:40,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:02:40,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:02:40,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:02:40,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:02:40,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:02:40,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:02:40,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:02:40,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:02:40,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:02:40,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:02:40,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:02:40,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:02:40,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:02:40,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:02:40,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:02:40,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:02:40,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:02:40,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:02:40,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:02:40,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:02:40,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:02:40,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:02:40,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:02:40,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:02:40,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:02:40,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:02:40,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:02:40,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:02:40,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:02:40,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:02:40,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:02:40,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:02:40,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:02:40,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:02:40,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:02:40,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:02:40,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:02:40,913 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 17:02:40,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:02:40,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:02:40,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 17:02:40,924 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 17:02:40,924 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 17:02:40,924 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 17:02:40,924 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 17:02:40,925 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 17:02:40,925 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 17:02:40,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:02:40,926 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:02:40,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:02:40,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:02:40,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:02:40,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:02:40,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:02:40,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:02:40,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:02:40,928 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 17:02:40,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:02:40,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:02:40,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:02:40,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:02:40,929 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_bfbd6a12-a874-4220-90e9-617a975a3d99/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 -> 3ac002b3633adb7e73afb8704d2ea9835992d8e2 [2019-12-07 17:02:41,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:02:41,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:02:41,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:02:41,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:02:41,038 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:02:41,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe021_pso.oepc.i [2019-12-07 17:02:41,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/data/aeb245e61/abd205edc6784c398be9988809266fa3/FLAGab7bb1a50 [2019-12-07 17:02:41,579 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:02:41,579 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/sv-benchmarks/c/pthread-wmm/safe021_pso.oepc.i [2019-12-07 17:02:41,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/data/aeb245e61/abd205edc6784c398be9988809266fa3/FLAGab7bb1a50 [2019-12-07 17:02:42,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/data/aeb245e61/abd205edc6784c398be9988809266fa3 [2019-12-07 17:02:42,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:02:42,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:02:42,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:02:42,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:02:42,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:02:42,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42, skipping insertion in model container [2019-12-07 17:02:42,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:02:42,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:02:42,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:02:42,347 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:02:42,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:02:42,433 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:02:42,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42 WrapperNode [2019-12-07 17:02:42,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:02:42,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:02:42,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:02:42,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:02:42,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:02:42,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:02:42,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:02:42,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:02:42,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... [2019-12-07 17:02:42,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:02:42,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:02:42,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:02:42,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:02:42,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/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 17:02:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:02:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:02:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:02:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:02:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:02:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:02:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:02:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:02:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:02:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:02:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:02:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:02:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:02:42,537 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 17:02:42,896 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:02:42,897 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:02:42,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:02:42 BoogieIcfgContainer [2019-12-07 17:02:42,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:02:42,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:02:42,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:02:42,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:02:42,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:02:42" (1/3) ... [2019-12-07 17:02:42,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51993995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:02:42, skipping insertion in model container [2019-12-07 17:02:42,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:02:42" (2/3) ... [2019-12-07 17:02:42,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51993995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:02:42, skipping insertion in model container [2019-12-07 17:02:42,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:02:42" (3/3) ... [2019-12-07 17:02:42,902 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-07 17:02:42,909 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:02:42,909 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:02:42,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:02:42,915 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:02:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:02:42,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:02:42,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:02:42,983 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:02:42,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:02:42,983 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:02:42,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:02:42,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:02:42,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:02:42,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:02:42,994 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 17:02:42,995 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 17:02:43,052 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 17:02:43,052 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:02:43,063 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:02:43,078 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 17:02:43,108 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 17:02:43,109 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:02:43,114 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:02:43,130 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 17:02:43,130 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:02:46,312 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 17:02:46,591 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-07 17:02:46,591 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 17:02:46,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-07 17:03:00,710 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-07 17:03:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-07 17:03:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:03:00,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:00,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:03:00,716 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 17:03:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-07 17:03:00,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:00,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519131186] [2019-12-07 17:03:00,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:00,862 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 17:03:00,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519131186] [2019-12-07 17:03:00,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:03:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472563841] [2019-12-07 17:03:00,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:03:00,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:03:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:03:00,878 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-07 17:03:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:03:01,646 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-07 17:03:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:03:01,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:03:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:03:02,028 INFO L225 Difference]: With dead ends: 110910 [2019-12-07 17:03:02,028 INFO L226 Difference]: Without dead ends: 98066 [2019-12-07 17:03:02,029 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 17:03:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-07 17:03:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-07 17:03:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-07 17:03:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-07 17:03:07,315 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-07 17:03:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:03:07,316 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-07 17:03:07,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:03:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-07 17:03:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:03:07,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:07,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:03:07,319 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 17:03:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-07 17:03:07,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:07,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490520323] [2019-12-07 17:03:07,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:07,382 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 17:03:07,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490520323] [2019-12-07 17:03:07,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:07,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:03:07,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464700078] [2019-12-07 17:03:07,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:03:07,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:03:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:03:07,384 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-07 17:03:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:03:08,264 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-07 17:03:08,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:03:08,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:03:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:03:10,831 INFO L225 Difference]: With dead ends: 156656 [2019-12-07 17:03:10,831 INFO L226 Difference]: Without dead ends: 156558 [2019-12-07 17:03:10,831 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 17:03:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-07 17:03:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-07 17:03:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-07 17:03:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-07 17:03:17,695 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-07 17:03:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:03:17,695 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-07 17:03:17,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:03:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-07 17:03:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:03:17,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:17,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:03:17,701 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 17:03:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-07 17:03:17,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:17,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451442534] [2019-12-07 17:03:17,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:17,751 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 17:03:17,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451442534] [2019-12-07 17:03:17,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:17,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:03:17,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557596015] [2019-12-07 17:03:17,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:03:17,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:03:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:03:17,752 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 4 states. [2019-12-07 17:03:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:03:18,732 INFO L93 Difference]: Finished difference Result 205190 states and 828176 transitions. [2019-12-07 17:03:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:03:18,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:03:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:03:19,243 INFO L225 Difference]: With dead ends: 205190 [2019-12-07 17:03:19,243 INFO L226 Difference]: Without dead ends: 205078 [2019-12-07 17:03:19,243 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 17:03:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205078 states. [2019-12-07 17:03:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205078 to 171310. [2019-12-07 17:03:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171310 states. [2019-12-07 17:03:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171310 states to 171310 states and 704416 transitions. [2019-12-07 17:03:29,194 INFO L78 Accepts]: Start accepts. Automaton has 171310 states and 704416 transitions. Word has length 13 [2019-12-07 17:03:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:03:29,195 INFO L462 AbstractCegarLoop]: Abstraction has 171310 states and 704416 transitions. [2019-12-07 17:03:29,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:03:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 171310 states and 704416 transitions. [2019-12-07 17:03:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:03:29,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:29,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:03:29,201 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 17:03:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-07 17:03:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166081332] [2019-12-07 17:03:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:29,252 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 17:03:29,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166081332] [2019-12-07 17:03:29,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:29,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:03:29,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130711001] [2019-12-07 17:03:29,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:03:29,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:03:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:03:29,253 INFO L87 Difference]: Start difference. First operand 171310 states and 704416 transitions. Second operand 5 states. [2019-12-07 17:03:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:03:30,451 INFO L93 Difference]: Finished difference Result 231848 states and 943034 transitions. [2019-12-07 17:03:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:03:30,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:03:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:03:31,480 INFO L225 Difference]: With dead ends: 231848 [2019-12-07 17:03:31,480 INFO L226 Difference]: Without dead ends: 231848 [2019-12-07 17:03:31,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:03:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231848 states. [2019-12-07 17:03:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231848 to 191437. [2019-12-07 17:03:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191437 states. [2019-12-07 17:03:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191437 states to 191437 states and 785356 transitions. [2019-12-07 17:03:42,197 INFO L78 Accepts]: Start accepts. Automaton has 191437 states and 785356 transitions. Word has length 16 [2019-12-07 17:03:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:03:42,198 INFO L462 AbstractCegarLoop]: Abstraction has 191437 states and 785356 transitions. [2019-12-07 17:03:42,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:03:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 191437 states and 785356 transitions. [2019-12-07 17:03:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:03:42,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:42,216 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 17:03:42,216 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 17:03:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1118041263, now seen corresponding path program 1 times [2019-12-07 17:03:42,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:42,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922279366] [2019-12-07 17:03:42,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:42,271 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 17:03:42,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922279366] [2019-12-07 17:03:42,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:42,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:03:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757761207] [2019-12-07 17:03:42,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:03:42,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:03:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:03:42,272 INFO L87 Difference]: Start difference. First operand 191437 states and 785356 transitions. Second operand 3 states. [2019-12-07 17:03:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:03:43,902 INFO L93 Difference]: Finished difference Result 343655 states and 1400507 transitions. [2019-12-07 17:03:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:03:43,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:03:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:03:44,672 INFO L225 Difference]: With dead ends: 343655 [2019-12-07 17:03:44,672 INFO L226 Difference]: Without dead ends: 308466 [2019-12-07 17:03:44,672 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 17:03:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308466 states. [2019-12-07 17:03:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308466 to 294588. [2019-12-07 17:03:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294588 states. [2019-12-07 17:03:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294588 states to 294588 states and 1210005 transitions. [2019-12-07 17:03:59,203 INFO L78 Accepts]: Start accepts. Automaton has 294588 states and 1210005 transitions. Word has length 18 [2019-12-07 17:03:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:03:59,204 INFO L462 AbstractCegarLoop]: Abstraction has 294588 states and 1210005 transitions. [2019-12-07 17:03:59,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:03:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 294588 states and 1210005 transitions. [2019-12-07 17:03:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:03:59,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:03:59,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:03:59,224 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 17:03:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:03:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2014810708, now seen corresponding path program 1 times [2019-12-07 17:03:59,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:03:59,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473808206] [2019-12-07 17:03:59,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:03:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:03:59,270 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 17:03:59,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473808206] [2019-12-07 17:03:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:03:59,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:03:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27853818] [2019-12-07 17:03:59,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:03:59,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:03:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:03:59,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:03:59,272 INFO L87 Difference]: Start difference. First operand 294588 states and 1210005 transitions. Second operand 4 states. [2019-12-07 17:04:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:00,923 INFO L93 Difference]: Finished difference Result 306954 states and 1248547 transitions. [2019-12-07 17:04:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:04:00,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:04:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:01,731 INFO L225 Difference]: With dead ends: 306954 [2019-12-07 17:04:01,731 INFO L226 Difference]: Without dead ends: 306954 [2019-12-07 17:04:01,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306954 states. [2019-12-07 17:04:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306954 to 294339. [2019-12-07 17:04:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294339 states. [2019-12-07 17:04:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294339 states to 294339 states and 1209056 transitions. [2019-12-07 17:04:16,342 INFO L78 Accepts]: Start accepts. Automaton has 294339 states and 1209056 transitions. Word has length 19 [2019-12-07 17:04:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:16,342 INFO L462 AbstractCegarLoop]: Abstraction has 294339 states and 1209056 transitions. [2019-12-07 17:04:16,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:04:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 294339 states and 1209056 transitions. [2019-12-07 17:04:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:04:16,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:16,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:16,362 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 17:04:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -465864047, now seen corresponding path program 1 times [2019-12-07 17:04:16,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:16,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292009235] [2019-12-07 17:04:16,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:16,385 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 17:04:16,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292009235] [2019-12-07 17:04:16,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:16,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:04:16,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389005775] [2019-12-07 17:04:16,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:04:16,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:04:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:04:16,387 INFO L87 Difference]: Start difference. First operand 294339 states and 1209056 transitions. Second operand 3 states. [2019-12-07 17:04:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:16,573 INFO L93 Difference]: Finished difference Result 55497 states and 180289 transitions. [2019-12-07 17:04:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:04:16,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:04:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:16,663 INFO L225 Difference]: With dead ends: 55497 [2019-12-07 17:04:16,664 INFO L226 Difference]: Without dead ends: 55497 [2019-12-07 17:04:16,664 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 17:04:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55497 states. [2019-12-07 17:04:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55497 to 55377. [2019-12-07 17:04:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55377 states. [2019-12-07 17:04:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55377 states to 55377 states and 179949 transitions. [2019-12-07 17:04:17,924 INFO L78 Accepts]: Start accepts. Automaton has 55377 states and 179949 transitions. Word has length 19 [2019-12-07 17:04:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:17,925 INFO L462 AbstractCegarLoop]: Abstraction has 55377 states and 179949 transitions. [2019-12-07 17:04:17,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:04:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55377 states and 179949 transitions. [2019-12-07 17:04:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:04:17,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:17,933 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 17:04:17,933 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 17:04:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-07 17:04:17,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:17,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943461634] [2019-12-07 17:04:17,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:17,976 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 17:04:17,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943461634] [2019-12-07 17:04:17,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:17,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:04:17,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253029532] [2019-12-07 17:04:17,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:04:17,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:04:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:17,978 INFO L87 Difference]: Start difference. First operand 55377 states and 179949 transitions. Second operand 6 states. [2019-12-07 17:04:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:18,672 INFO L93 Difference]: Finished difference Result 81342 states and 256996 transitions. [2019-12-07 17:04:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:04:18,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 17:04:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:18,786 INFO L225 Difference]: With dead ends: 81342 [2019-12-07 17:04:18,786 INFO L226 Difference]: Without dead ends: 81328 [2019-12-07 17:04:18,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:04:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81328 states. [2019-12-07 17:04:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81328 to 57827. [2019-12-07 17:04:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57827 states. [2019-12-07 17:04:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57827 states to 57827 states and 186427 transitions. [2019-12-07 17:04:20,397 INFO L78 Accepts]: Start accepts. Automaton has 57827 states and 186427 transitions. Word has length 22 [2019-12-07 17:04:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:20,397 INFO L462 AbstractCegarLoop]: Abstraction has 57827 states and 186427 transitions. [2019-12-07 17:04:20,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:04:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57827 states and 186427 transitions. [2019-12-07 17:04:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:04:20,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:20,410 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 17:04:20,410 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 17:04:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-07 17:04:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:20,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970632498] [2019-12-07 17:04:20,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:20,461 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 17:04:20,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970632498] [2019-12-07 17:04:20,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:20,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:20,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454377085] [2019-12-07 17:04:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:20,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:20,463 INFO L87 Difference]: Start difference. First operand 57827 states and 186427 transitions. Second operand 5 states. [2019-12-07 17:04:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:20,913 INFO L93 Difference]: Finished difference Result 78724 states and 248550 transitions. [2019-12-07 17:04:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:04:20,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:04:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:21,024 INFO L225 Difference]: With dead ends: 78724 [2019-12-07 17:04:21,024 INFO L226 Difference]: Without dead ends: 78698 [2019-12-07 17:04:21,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 17:04:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78698 states. [2019-12-07 17:04:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78698 to 69170. [2019-12-07 17:04:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69170 states. [2019-12-07 17:04:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69170 states to 69170 states and 221204 transitions. [2019-12-07 17:04:22,227 INFO L78 Accepts]: Start accepts. Automaton has 69170 states and 221204 transitions. Word has length 25 [2019-12-07 17:04:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:22,227 INFO L462 AbstractCegarLoop]: Abstraction has 69170 states and 221204 transitions. [2019-12-07 17:04:22,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 69170 states and 221204 transitions. [2019-12-07 17:04:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:04:22,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:22,247 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 17:04:22,247 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 17:04:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-07 17:04:22,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:22,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722478071] [2019-12-07 17:04:22,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:22,297 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 17:04:22,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722478071] [2019-12-07 17:04:22,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:22,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:04:22,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023750791] [2019-12-07 17:04:22,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:04:22,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:04:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:22,298 INFO L87 Difference]: Start difference. First operand 69170 states and 221204 transitions. Second operand 6 states. [2019-12-07 17:04:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:23,227 INFO L93 Difference]: Finished difference Result 91231 states and 285307 transitions. [2019-12-07 17:04:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:04:23,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 17:04:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:23,351 INFO L225 Difference]: With dead ends: 91231 [2019-12-07 17:04:23,351 INFO L226 Difference]: Without dead ends: 91155 [2019-12-07 17:04:23,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:04:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91155 states. [2019-12-07 17:04:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91155 to 76146. [2019-12-07 17:04:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76146 states. [2019-12-07 17:04:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76146 states to 76146 states and 242020 transitions. [2019-12-07 17:04:24,630 INFO L78 Accepts]: Start accepts. Automaton has 76146 states and 242020 transitions. Word has length 27 [2019-12-07 17:04:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:24,630 INFO L462 AbstractCegarLoop]: Abstraction has 76146 states and 242020 transitions. [2019-12-07 17:04:24,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:04:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76146 states and 242020 transitions. [2019-12-07 17:04:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:04:24,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:24,651 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 17:04:24,651 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 17:04:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1410388321, now seen corresponding path program 1 times [2019-12-07 17:04:24,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:24,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240810351] [2019-12-07 17:04:24,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:24,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 17:04:24,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240810351] [2019-12-07 17:04:24,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:24,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:04:24,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337422320] [2019-12-07 17:04:24,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:24,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:24,707 INFO L87 Difference]: Start difference. First operand 76146 states and 242020 transitions. Second operand 5 states. [2019-12-07 17:04:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:25,323 INFO L93 Difference]: Finished difference Result 101706 states and 321214 transitions. [2019-12-07 17:04:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:04:25,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:04:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:25,484 INFO L225 Difference]: With dead ends: 101706 [2019-12-07 17:04:25,484 INFO L226 Difference]: Without dead ends: 101706 [2019-12-07 17:04:25,484 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 17:04:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101706 states. [2019-12-07 17:04:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101706 to 91923. [2019-12-07 17:04:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91923 states. [2019-12-07 17:04:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91923 states to 91923 states and 292159 transitions. [2019-12-07 17:04:27,046 INFO L78 Accepts]: Start accepts. Automaton has 91923 states and 292159 transitions. Word has length 29 [2019-12-07 17:04:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:27,046 INFO L462 AbstractCegarLoop]: Abstraction has 91923 states and 292159 transitions. [2019-12-07 17:04:27,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 91923 states and 292159 transitions. [2019-12-07 17:04:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:04:27,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:27,075 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 17:04:27,075 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 17:04:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1832040381, now seen corresponding path program 1 times [2019-12-07 17:04:27,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:27,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851846733] [2019-12-07 17:04:27,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:27,119 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 17:04:27,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851846733] [2019-12-07 17:04:27,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:27,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:04:27,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784930609] [2019-12-07 17:04:27,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:27,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:27,121 INFO L87 Difference]: Start difference. First operand 91923 states and 292159 transitions. Second operand 5 states. [2019-12-07 17:04:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:27,820 INFO L93 Difference]: Finished difference Result 121693 states and 383412 transitions. [2019-12-07 17:04:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:04:27,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:04:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:28,156 INFO L225 Difference]: With dead ends: 121693 [2019-12-07 17:04:28,156 INFO L226 Difference]: Without dead ends: 121679 [2019-12-07 17:04:28,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:04:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121679 states. [2019-12-07 17:04:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121679 to 100928. [2019-12-07 17:04:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100928 states. [2019-12-07 17:04:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100928 states to 100928 states and 321387 transitions. [2019-12-07 17:04:29,825 INFO L78 Accepts]: Start accepts. Automaton has 100928 states and 321387 transitions. Word has length 29 [2019-12-07 17:04:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:29,825 INFO L462 AbstractCegarLoop]: Abstraction has 100928 states and 321387 transitions. [2019-12-07 17:04:29,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 100928 states and 321387 transitions. [2019-12-07 17:04:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:04:29,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:29,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:29,871 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 17:04:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 489045679, now seen corresponding path program 1 times [2019-12-07 17:04:29,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:29,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083244664] [2019-12-07 17:04:29,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:29,909 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 17:04:29,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083244664] [2019-12-07 17:04:29,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:29,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:29,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345635005] [2019-12-07 17:04:29,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:04:29,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:04:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:29,910 INFO L87 Difference]: Start difference. First operand 100928 states and 321387 transitions. Second operand 4 states. [2019-12-07 17:04:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:30,043 INFO L93 Difference]: Finished difference Result 44808 states and 135333 transitions. [2019-12-07 17:04:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:04:30,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 17:04:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:30,096 INFO L225 Difference]: With dead ends: 44808 [2019-12-07 17:04:30,096 INFO L226 Difference]: Without dead ends: 44808 [2019-12-07 17:04:30,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44808 states. [2019-12-07 17:04:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44808 to 41439. [2019-12-07 17:04:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41439 states. [2019-12-07 17:04:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41439 states to 41439 states and 125355 transitions. [2019-12-07 17:04:30,768 INFO L78 Accepts]: Start accepts. Automaton has 41439 states and 125355 transitions. Word has length 30 [2019-12-07 17:04:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:30,768 INFO L462 AbstractCegarLoop]: Abstraction has 41439 states and 125355 transitions. [2019-12-07 17:04:30,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:04:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41439 states and 125355 transitions. [2019-12-07 17:04:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:04:30,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:30,798 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 17:04:30,798 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 17:04:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-07 17:04:30,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:30,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103827894] [2019-12-07 17:04:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:30,862 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 17:04:30,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103827894] [2019-12-07 17:04:30,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:30,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:04:30,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506215986] [2019-12-07 17:04:30,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:04:30,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:04:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:04:30,864 INFO L87 Difference]: Start difference. First operand 41439 states and 125355 transitions. Second operand 7 states. [2019-12-07 17:04:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:31,642 INFO L93 Difference]: Finished difference Result 54819 states and 161909 transitions. [2019-12-07 17:04:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:04:31,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 17:04:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:31,707 INFO L225 Difference]: With dead ends: 54819 [2019-12-07 17:04:31,708 INFO L226 Difference]: Without dead ends: 54819 [2019-12-07 17:04:31,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:04:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54819 states. [2019-12-07 17:04:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54819 to 43014. [2019-12-07 17:04:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43014 states. [2019-12-07 17:04:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43014 states to 43014 states and 129838 transitions. [2019-12-07 17:04:32,394 INFO L78 Accepts]: Start accepts. Automaton has 43014 states and 129838 transitions. Word has length 33 [2019-12-07 17:04:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:32,394 INFO L462 AbstractCegarLoop]: Abstraction has 43014 states and 129838 transitions. [2019-12-07 17:04:32,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:04:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43014 states and 129838 transitions. [2019-12-07 17:04:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:04:32,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:32,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:32,430 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 17:04:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 1 times [2019-12-07 17:04:32,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:32,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158357217] [2019-12-07 17:04:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:32,488 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 17:04:32,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158357217] [2019-12-07 17:04:32,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:32,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:04:32,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295018989] [2019-12-07 17:04:32,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:04:32,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:04:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:32,490 INFO L87 Difference]: Start difference. First operand 43014 states and 129838 transitions. Second operand 6 states. [2019-12-07 17:04:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:33,325 INFO L93 Difference]: Finished difference Result 55583 states and 165384 transitions. [2019-12-07 17:04:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:04:33,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 17:04:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:33,391 INFO L225 Difference]: With dead ends: 55583 [2019-12-07 17:04:33,391 INFO L226 Difference]: Without dead ends: 55583 [2019-12-07 17:04:33,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:04:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55583 states. [2019-12-07 17:04:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55583 to 44259. [2019-12-07 17:04:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44259 states. [2019-12-07 17:04:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44259 states to 44259 states and 133567 transitions. [2019-12-07 17:04:34,081 INFO L78 Accepts]: Start accepts. Automaton has 44259 states and 133567 transitions. Word has length 39 [2019-12-07 17:04:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:34,082 INFO L462 AbstractCegarLoop]: Abstraction has 44259 states and 133567 transitions. [2019-12-07 17:04:34,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:04:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 44259 states and 133567 transitions. [2019-12-07 17:04:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:04:34,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:34,119 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 17:04:34,119 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 17:04:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash -242972074, now seen corresponding path program 2 times [2019-12-07 17:04:34,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:34,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268183400] [2019-12-07 17:04:34,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:34,188 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 17:04:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268183400] [2019-12-07 17:04:34,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:34,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:04:34,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143577934] [2019-12-07 17:04:34,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:04:34,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:04:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:04:34,189 INFO L87 Difference]: Start difference. First operand 44259 states and 133567 transitions. Second operand 7 states. [2019-12-07 17:04:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:35,011 INFO L93 Difference]: Finished difference Result 66412 states and 200285 transitions. [2019-12-07 17:04:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:04:35,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 17:04:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:35,095 INFO L225 Difference]: With dead ends: 66412 [2019-12-07 17:04:35,095 INFO L226 Difference]: Without dead ends: 66412 [2019-12-07 17:04:35,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:04:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66412 states. [2019-12-07 17:04:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66412 to 44414. [2019-12-07 17:04:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44414 states. [2019-12-07 17:04:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44414 states to 44414 states and 134012 transitions. [2019-12-07 17:04:35,927 INFO L78 Accepts]: Start accepts. Automaton has 44414 states and 134012 transitions. Word has length 39 [2019-12-07 17:04:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:35,927 INFO L462 AbstractCegarLoop]: Abstraction has 44414 states and 134012 transitions. [2019-12-07 17:04:35,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:04:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 44414 states and 134012 transitions. [2019-12-07 17:04:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:04:35,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:35,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:35,964 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 17:04:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1498567494, now seen corresponding path program 1 times [2019-12-07 17:04:35,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:35,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510134594] [2019-12-07 17:04:35,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:36,115 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 17:04:36,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510134594] [2019-12-07 17:04:36,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:36,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:04:36,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087979161] [2019-12-07 17:04:36,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:04:36,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:04:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:04:36,117 INFO L87 Difference]: Start difference. First operand 44414 states and 134012 transitions. Second operand 10 states. [2019-12-07 17:04:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:36,477 INFO L93 Difference]: Finished difference Result 46156 states and 138932 transitions. [2019-12-07 17:04:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:04:36,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-07 17:04:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:36,529 INFO L225 Difference]: With dead ends: 46156 [2019-12-07 17:04:36,529 INFO L226 Difference]: Without dead ends: 46156 [2019-12-07 17:04:36,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:04:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46156 states. [2019-12-07 17:04:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46156 to 43558. [2019-12-07 17:04:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43558 states. [2019-12-07 17:04:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43558 states to 43558 states and 131498 transitions. [2019-12-07 17:04:37,136 INFO L78 Accepts]: Start accepts. Automaton has 43558 states and 131498 transitions. Word has length 40 [2019-12-07 17:04:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:37,136 INFO L462 AbstractCegarLoop]: Abstraction has 43558 states and 131498 transitions. [2019-12-07 17:04:37,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:04:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43558 states and 131498 transitions. [2019-12-07 17:04:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:04:37,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:37,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:37,174 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 17:04:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1202989435, now seen corresponding path program 1 times [2019-12-07 17:04:37,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:37,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888813752] [2019-12-07 17:04:37,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:37,210 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 17:04:37,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888813752] [2019-12-07 17:04:37,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:37,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:04:37,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305277468] [2019-12-07 17:04:37,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:04:37,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:04:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:04:37,212 INFO L87 Difference]: Start difference. First operand 43558 states and 131498 transitions. Second operand 3 states. [2019-12-07 17:04:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:37,319 INFO L93 Difference]: Finished difference Result 43558 states and 131403 transitions. [2019-12-07 17:04:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:04:37,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 17:04:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:37,369 INFO L225 Difference]: With dead ends: 43558 [2019-12-07 17:04:37,369 INFO L226 Difference]: Without dead ends: 43558 [2019-12-07 17:04:37,369 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 17:04:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43558 states. [2019-12-07 17:04:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43558 to 37928. [2019-12-07 17:04:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37928 states. [2019-12-07 17:04:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37928 states to 37928 states and 115536 transitions. [2019-12-07 17:04:37,944 INFO L78 Accepts]: Start accepts. Automaton has 37928 states and 115536 transitions. Word has length 41 [2019-12-07 17:04:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:37,945 INFO L462 AbstractCegarLoop]: Abstraction has 37928 states and 115536 transitions. [2019-12-07 17:04:37,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:04:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37928 states and 115536 transitions. [2019-12-07 17:04:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:04:38,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:38,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:38,056 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 17:04:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash 477776879, now seen corresponding path program 1 times [2019-12-07 17:04:38,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:38,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589796567] [2019-12-07 17:04:38,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:38,086 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 17:04:38,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589796567] [2019-12-07 17:04:38,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:38,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:04:38,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609539497] [2019-12-07 17:04:38,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:04:38,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:04:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:04:38,087 INFO L87 Difference]: Start difference. First operand 37928 states and 115536 transitions. Second operand 3 states. [2019-12-07 17:04:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:38,170 INFO L93 Difference]: Finished difference Result 33641 states and 100710 transitions. [2019-12-07 17:04:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:04:38,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 17:04:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:38,207 INFO L225 Difference]: With dead ends: 33641 [2019-12-07 17:04:38,207 INFO L226 Difference]: Without dead ends: 33641 [2019-12-07 17:04:38,207 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 17:04:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33641 states. [2019-12-07 17:04:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33641 to 32973. [2019-12-07 17:04:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32973 states. [2019-12-07 17:04:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32973 states to 32973 states and 98821 transitions. [2019-12-07 17:04:38,654 INFO L78 Accepts]: Start accepts. Automaton has 32973 states and 98821 transitions. Word has length 41 [2019-12-07 17:04:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:38,654 INFO L462 AbstractCegarLoop]: Abstraction has 32973 states and 98821 transitions. [2019-12-07 17:04:38,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:04:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32973 states and 98821 transitions. [2019-12-07 17:04:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:04:38,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:38,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:38,683 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 17:04:38,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash 271932427, now seen corresponding path program 1 times [2019-12-07 17:04:38,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:38,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496020299] [2019-12-07 17:04:38,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:38,719 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 17:04:38,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496020299] [2019-12-07 17:04:38,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:38,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:04:38,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487407606] [2019-12-07 17:04:38,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:38,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:38,720 INFO L87 Difference]: Start difference. First operand 32973 states and 98821 transitions. Second operand 5 states. [2019-12-07 17:04:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:38,809 INFO L93 Difference]: Finished difference Result 30728 states and 93846 transitions. [2019-12-07 17:04:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:04:38,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 17:04:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:38,844 INFO L225 Difference]: With dead ends: 30728 [2019-12-07 17:04:38,844 INFO L226 Difference]: Without dead ends: 30221 [2019-12-07 17:04:38,844 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 17:04:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30221 states. [2019-12-07 17:04:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30221 to 17379. [2019-12-07 17:04:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17379 states. [2019-12-07 17:04:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17379 states to 17379 states and 53153 transitions. [2019-12-07 17:04:39,159 INFO L78 Accepts]: Start accepts. Automaton has 17379 states and 53153 transitions. Word has length 42 [2019-12-07 17:04:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:39,159 INFO L462 AbstractCegarLoop]: Abstraction has 17379 states and 53153 transitions. [2019-12-07 17:04:39,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17379 states and 53153 transitions. [2019-12-07 17:04:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:04:39,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:39,174 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 17:04:39,174 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 17:04:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1448287585, now seen corresponding path program 1 times [2019-12-07 17:04:39,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:39,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070595059] [2019-12-07 17:04:39,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:39,199 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 17:04:39,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070595059] [2019-12-07 17:04:39,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:39,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:39,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955097815] [2019-12-07 17:04:39,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:04:39,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:04:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:04:39,201 INFO L87 Difference]: Start difference. First operand 17379 states and 53153 transitions. Second operand 3 states. [2019-12-07 17:04:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:39,283 INFO L93 Difference]: Finished difference Result 24570 states and 75532 transitions. [2019-12-07 17:04:39,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:04:39,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 17:04:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:39,310 INFO L225 Difference]: With dead ends: 24570 [2019-12-07 17:04:39,311 INFO L226 Difference]: Without dead ends: 24570 [2019-12-07 17:04:39,311 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 17:04:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24570 states. [2019-12-07 17:04:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24570 to 19768. [2019-12-07 17:04:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19768 states. [2019-12-07 17:04:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19768 states to 19768 states and 61280 transitions. [2019-12-07 17:04:39,629 INFO L78 Accepts]: Start accepts. Automaton has 19768 states and 61280 transitions. Word has length 66 [2019-12-07 17:04:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:39,630 INFO L462 AbstractCegarLoop]: Abstraction has 19768 states and 61280 transitions. [2019-12-07 17:04:39,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:04:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19768 states and 61280 transitions. [2019-12-07 17:04:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:04:39,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:39,646 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 17:04:39,647 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 17:04:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash 464347479, now seen corresponding path program 1 times [2019-12-07 17:04:39,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:39,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075226399] [2019-12-07 17:04:39,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:39,707 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 17:04:39,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075226399] [2019-12-07 17:04:39,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:39,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:04:39,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114249572] [2019-12-07 17:04:39,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:04:39,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:04:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:04:39,708 INFO L87 Difference]: Start difference. First operand 19768 states and 61280 transitions. Second operand 7 states. [2019-12-07 17:04:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:40,314 INFO L93 Difference]: Finished difference Result 30203 states and 91553 transitions. [2019-12-07 17:04:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:04:40,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 17:04:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:40,346 INFO L225 Difference]: With dead ends: 30203 [2019-12-07 17:04:40,346 INFO L226 Difference]: Without dead ends: 30203 [2019-12-07 17:04:40,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:04:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30203 states. [2019-12-07 17:04:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30203 to 21365. [2019-12-07 17:04:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21365 states. [2019-12-07 17:04:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21365 states to 21365 states and 65988 transitions. [2019-12-07 17:04:40,713 INFO L78 Accepts]: Start accepts. Automaton has 21365 states and 65988 transitions. Word has length 66 [2019-12-07 17:04:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:40,713 INFO L462 AbstractCegarLoop]: Abstraction has 21365 states and 65988 transitions. [2019-12-07 17:04:40,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:04:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21365 states and 65988 transitions. [2019-12-07 17:04:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:04:40,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:40,730 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 17:04:40,730 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 17:04:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 656468705, now seen corresponding path program 2 times [2019-12-07 17:04:40,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:40,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268088776] [2019-12-07 17:04:40,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:40,770 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 17:04:40,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268088776] [2019-12-07 17:04:40,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:40,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:04:40,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339879155] [2019-12-07 17:04:40,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:04:40,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:04:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:04:40,771 INFO L87 Difference]: Start difference. First operand 21365 states and 65988 transitions. Second operand 3 states. [2019-12-07 17:04:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:40,860 INFO L93 Difference]: Finished difference Result 25032 states and 77039 transitions. [2019-12-07 17:04:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:04:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 17:04:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:40,890 INFO L225 Difference]: With dead ends: 25032 [2019-12-07 17:04:40,890 INFO L226 Difference]: Without dead ends: 25032 [2019-12-07 17:04:40,890 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 17:04:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25032 states. [2019-12-07 17:04:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25032 to 21288. [2019-12-07 17:04:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21288 states. [2019-12-07 17:04:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21288 states to 21288 states and 65878 transitions. [2019-12-07 17:04:41,220 INFO L78 Accepts]: Start accepts. Automaton has 21288 states and 65878 transitions. Word has length 66 [2019-12-07 17:04:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 21288 states and 65878 transitions. [2019-12-07 17:04:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:04:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21288 states and 65878 transitions. [2019-12-07 17:04:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:04:41,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:41,237 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 17:04:41,237 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 17:04:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash 280559689, now seen corresponding path program 1 times [2019-12-07 17:04:41,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:41,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032618824] [2019-12-07 17:04:41,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:41,274 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 17:04:41,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032618824] [2019-12-07 17:04:41,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:41,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:41,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19433105] [2019-12-07 17:04:41,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:04:41,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:04:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:04:41,275 INFO L87 Difference]: Start difference. First operand 21288 states and 65878 transitions. Second operand 4 states. [2019-12-07 17:04:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:41,367 INFO L93 Difference]: Finished difference Result 21288 states and 65661 transitions. [2019-12-07 17:04:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:04:41,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:04:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:41,391 INFO L225 Difference]: With dead ends: 21288 [2019-12-07 17:04:41,392 INFO L226 Difference]: Without dead ends: 21288 [2019-12-07 17:04:41,392 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 17:04:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21288 states. [2019-12-07 17:04:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21288 to 19607. [2019-12-07 17:04:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-07 17:04:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 60455 transitions. [2019-12-07 17:04:41,689 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 60455 transitions. Word has length 67 [2019-12-07 17:04:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:41,689 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 60455 transitions. [2019-12-07 17:04:41,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:04:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 60455 transitions. [2019-12-07 17:04:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:04:41,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:41,708 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 17:04:41,708 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 17:04:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1605184731, now seen corresponding path program 1 times [2019-12-07 17:04:41,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:41,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307868788] [2019-12-07 17:04:41,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:41,777 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 17:04:41,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307868788] [2019-12-07 17:04:41,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:41,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:04:41,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823784613] [2019-12-07 17:04:41,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:04:41,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:04:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:04:41,778 INFO L87 Difference]: Start difference. First operand 19607 states and 60455 transitions. Second operand 5 states. [2019-12-07 17:04:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:41,927 INFO L93 Difference]: Finished difference Result 48993 states and 151971 transitions. [2019-12-07 17:04:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:04:41,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 17:04:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:41,964 INFO L225 Difference]: With dead ends: 48993 [2019-12-07 17:04:41,964 INFO L226 Difference]: Without dead ends: 30708 [2019-12-07 17:04:41,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:04:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30708 states. [2019-12-07 17:04:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30708 to 18443. [2019-12-07 17:04:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18443 states. [2019-12-07 17:04:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18443 states to 18443 states and 56759 transitions. [2019-12-07 17:04:42,287 INFO L78 Accepts]: Start accepts. Automaton has 18443 states and 56759 transitions. Word has length 67 [2019-12-07 17:04:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:42,288 INFO L462 AbstractCegarLoop]: Abstraction has 18443 states and 56759 transitions. [2019-12-07 17:04:42,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:04:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 56759 transitions. [2019-12-07 17:04:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:04:42,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:42,303 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 17:04:42,303 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 17:04:42,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 2 times [2019-12-07 17:04:42,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:42,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732373231] [2019-12-07 17:04:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:04:42,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732373231] [2019-12-07 17:04:42,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:42,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:04:42,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707336955] [2019-12-07 17:04:42,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:04:42,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:04:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:04:42,576 INFO L87 Difference]: Start difference. First operand 18443 states and 56759 transitions. Second operand 15 states. [2019-12-07 17:04:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:48,645 INFO L93 Difference]: Finished difference Result 91089 states and 277642 transitions. [2019-12-07 17:04:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-12-07 17:04:48,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 17:04:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:48,718 INFO L225 Difference]: With dead ends: 91089 [2019-12-07 17:04:48,719 INFO L226 Difference]: Without dead ends: 57863 [2019-12-07 17:04:48,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5617 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1906, Invalid=12374, Unknown=0, NotChecked=0, Total=14280 [2019-12-07 17:04:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57863 states. [2019-12-07 17:04:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57863 to 22179. [2019-12-07 17:04:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22179 states. [2019-12-07 17:04:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22179 states to 22179 states and 67976 transitions. [2019-12-07 17:04:49,257 INFO L78 Accepts]: Start accepts. Automaton has 22179 states and 67976 transitions. Word has length 67 [2019-12-07 17:04:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:49,257 INFO L462 AbstractCegarLoop]: Abstraction has 22179 states and 67976 transitions. [2019-12-07 17:04:49,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:04:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22179 states and 67976 transitions. [2019-12-07 17:04:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:04:49,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:49,320 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 17:04:49,320 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 17:04:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 3 times [2019-12-07 17:04:49,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:49,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859152413] [2019-12-07 17:04:49,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:49,451 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 17:04:49,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859152413] [2019-12-07 17:04:49,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:49,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:04:49,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220513875] [2019-12-07 17:04:49,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:04:49,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:04:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:04:49,452 INFO L87 Difference]: Start difference. First operand 22179 states and 67976 transitions. Second operand 12 states. [2019-12-07 17:04:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:50,498 INFO L93 Difference]: Finished difference Result 54516 states and 166038 transitions. [2019-12-07 17:04:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 17:04:50,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 17:04:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:50,543 INFO L225 Difference]: With dead ends: 54516 [2019-12-07 17:04:50,543 INFO L226 Difference]: Without dead ends: 34708 [2019-12-07 17:04:50,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 17:04:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34708 states. [2019-12-07 17:04:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34708 to 20663. [2019-12-07 17:04:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20663 states. [2019-12-07 17:04:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20663 states to 20663 states and 62918 transitions. [2019-12-07 17:04:50,918 INFO L78 Accepts]: Start accepts. Automaton has 20663 states and 62918 transitions. Word has length 67 [2019-12-07 17:04:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:04:50,919 INFO L462 AbstractCegarLoop]: Abstraction has 20663 states and 62918 transitions. [2019-12-07 17:04:50,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:04:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 20663 states and 62918 transitions. [2019-12-07 17:04:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:04:50,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:04:50,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:04:50,935 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 17:04:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:04:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1650094651, now seen corresponding path program 4 times [2019-12-07 17:04:50,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:04:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056664132] [2019-12-07 17:04:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:04:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:04:51,164 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 17:04:51,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056664132] [2019-12-07 17:04:51,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:04:51,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:04:51,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824949002] [2019-12-07 17:04:51,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:04:51,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:04:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:04:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:04:51,166 INFO L87 Difference]: Start difference. First operand 20663 states and 62918 transitions. Second operand 13 states. [2019-12-07 17:04:54,712 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-07 17:04:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:04:59,812 INFO L93 Difference]: Finished difference Result 49529 states and 151198 transitions. [2019-12-07 17:04:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-07 17:04:59,812 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 17:04:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:04:59,863 INFO L225 Difference]: With dead ends: 49529 [2019-12-07 17:04:59,863 INFO L226 Difference]: Without dead ends: 48330 [2019-12-07 17:04:59,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=966, Invalid=5514, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 17:04:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48330 states. [2019-12-07 17:05:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48330 to 23236. [2019-12-07 17:05:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23236 states. [2019-12-07 17:05:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23236 states to 23236 states and 70879 transitions. [2019-12-07 17:05:00,333 INFO L78 Accepts]: Start accepts. Automaton has 23236 states and 70879 transitions. Word has length 67 [2019-12-07 17:05:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:00,333 INFO L462 AbstractCegarLoop]: Abstraction has 23236 states and 70879 transitions. [2019-12-07 17:05:00,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:05:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 23236 states and 70879 transitions. [2019-12-07 17:05:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:05:00,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:00,354 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 17:05:00,354 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 17:05:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1428788687, now seen corresponding path program 5 times [2019-12-07 17:05:00,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:05:00,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091430165] [2019-12-07 17:05:00,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:05:00,411 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 17:05:00,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091430165] [2019-12-07 17:05:00,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:05:00,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:05:00,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032917418] [2019-12-07 17:05:00,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:05:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:05:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:05:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:05:00,412 INFO L87 Difference]: Start difference. First operand 23236 states and 70879 transitions. Second operand 6 states. [2019-12-07 17:05:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:05:00,769 INFO L93 Difference]: Finished difference Result 59878 states and 178506 transitions. [2019-12-07 17:05:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:05:00,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 17:05:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:05:00,835 INFO L225 Difference]: With dead ends: 59878 [2019-12-07 17:05:00,835 INFO L226 Difference]: Without dead ends: 54451 [2019-12-07 17:05:00,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:05:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54451 states. [2019-12-07 17:05:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54451 to 21036. [2019-12-07 17:05:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-07 17:05:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 64292 transitions. [2019-12-07 17:05:01,327 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 64292 transitions. Word has length 67 [2019-12-07 17:05:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:05:01,327 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 64292 transitions. [2019-12-07 17:05:01,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:05:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 64292 transitions. [2019-12-07 17:05:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:05:01,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:05:01,344 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 17:05:01,344 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 17:05:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:05:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 6 times [2019-12-07 17:05:01,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:05:01,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382904872] [2019-12-07 17:05:01,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:05:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:05:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:05:01,423 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 17:05:01,423 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:05:01,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26|)) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_26|) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26|) |v_ULTIMATE.start_main_~#t2287~0.offset_19| 0))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_26| 4)) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_19|) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_26|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:05:01,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-07 17:05:01,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491)) (= |P0Thread1of1ForFork0_#in~arg.offset_In974088491| P0Thread1of1ForFork0_~arg.offset_Out974088491) (= ~z$w_buff0~0_Out974088491 1) (= P0Thread1of1ForFork0_~arg.base_Out974088491 |P0Thread1of1ForFork0_#in~arg.base_In974088491|) (= ~z$w_buff1~0_Out974088491 ~z$w_buff0~0_In974088491) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out974088491 256))) (not (= (mod ~z$w_buff0_used~0_Out974088491 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491) (= 1 ~z$w_buff0_used~0_Out974088491) (= ~z$w_buff0_used~0_In974088491 ~z$w_buff1_used~0_Out974088491)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In974088491|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974088491, ~z$w_buff0~0=~z$w_buff0~0_In974088491, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In974088491|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In974088491|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out974088491, ~z$w_buff0~0=~z$w_buff0~0_Out974088491, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out974088491, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In974088491|, ~z$w_buff1~0=~z$w_buff1~0_Out974088491, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out974088491, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out974088491} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:05:01,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-07 17:05:01,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1377813716 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1377813716 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out-1377813716| |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1377813716 |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|) .cse2) (and (= ~z~0_In-1377813716 |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1377813716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1377813716, ~z$w_buff1~0=~z$w_buff1~0_In-1377813716, ~z~0=~z~0_In-1377813716} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1377813716|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1377813716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1377813716, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1377813716|, ~z$w_buff1~0=~z$w_buff1~0_In-1377813716, ~z~0=~z~0_In-1377813716} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 17:05:01,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1134272488 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1134272488 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1134272488| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1134272488| ~z$w_buff0_used~0_In1134272488)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1134272488, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1134272488} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1134272488, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1134272488|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1134272488} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 17:05:01,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-545988864 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-545988864 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-545988864 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-545988864 256)))) (or (and (= ~z$w_buff1_used~0_In-545988864 |P1Thread1of1ForFork1_#t~ite12_Out-545988864|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-545988864|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-545988864, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-545988864, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545988864, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-545988864} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-545988864, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-545988864, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545988864, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-545988864|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-545988864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 17:05:01,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1047871323 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1047871323 256)))) (or (and (= ~z$r_buff0_thd2~0_In1047871323 |P1Thread1of1ForFork1_#t~ite13_Out1047871323|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1047871323| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1047871323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1047871323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1047871323, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1047871323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1047871323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 17:05:01,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1073800007 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1073800007| |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1073800007 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1073800007 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1073800007 256)) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In-1073800007 256) 0) .cse0))) .cse1 (= ~z$w_buff1~0_In-1073800007 |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|)) (and (= ~z$w_buff1~0_In-1073800007 |P2Thread1of1ForFork2_#t~ite24_Out-1073800007|) (= |P2Thread1of1ForFork2_#t~ite23_In-1073800007| |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1073800007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1073800007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1073800007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1073800007, ~z$w_buff1~0=~z$w_buff1~0_In-1073800007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1073800007, ~weak$$choice2~0=~weak$$choice2~0_In-1073800007} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1073800007|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1073800007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1073800007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1073800007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1073800007, ~z$w_buff1~0=~z$w_buff1~0_In-1073800007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1073800007, ~weak$$choice2~0=~weak$$choice2~0_In-1073800007} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 17:05:01,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In974507265 256) 0))) (or (and (= ~z$w_buff0_used~0_In974507265 |P2Thread1of1ForFork2_#t~ite27_Out974507265|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In974507265| |P2Thread1of1ForFork2_#t~ite26_Out974507265|)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out974507265| |P2Thread1of1ForFork2_#t~ite27_Out974507265|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In974507265 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In974507265 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In974507265 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In974507265 256))))) (= ~z$w_buff0_used~0_In974507265 |P2Thread1of1ForFork2_#t~ite26_Out974507265|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In974507265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974507265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In974507265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In974507265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In974507265, ~weak$$choice2~0=~weak$$choice2~0_In974507265} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out974507265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974507265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In974507265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In974507265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In974507265, ~weak$$choice2~0=~weak$$choice2~0_In974507265, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out974507265|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 17:05:01,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1048776956 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1048776956 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1048776956 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1048776956 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1048776956|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1048776956 |P1Thread1of1ForFork1_#t~ite14_Out1048776956|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1048776956, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1048776956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1048776956, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1048776956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1048776956, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1048776956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1048776956, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1048776956|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1048776956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:05:01,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:05:01,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1371325201 256) 0))) (or (and (= ~z$w_buff1_used~0_In1371325201 |P2Thread1of1ForFork2_#t~ite30_Out1371325201|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In1371325201| |P2Thread1of1ForFork2_#t~ite29_Out1371325201|)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out1371325201| ~z$w_buff1_used~0_In1371325201) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1371325201 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1371325201 256))) (= (mod ~z$w_buff0_used~0_In1371325201 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1371325201 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out1371325201| |P2Thread1of1ForFork2_#t~ite30_Out1371325201|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1371325201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1371325201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371325201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1371325201, ~weak$$choice2~0=~weak$$choice2~0_In1371325201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1371325201|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1371325201|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1371325201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1371325201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371325201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1371325201, ~weak$$choice2~0=~weak$$choice2~0_In1371325201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1371325201|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 17:05:01,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 17:05:01,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:05:01,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1675012109 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1675012109 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1675012109 |P0Thread1of1ForFork0_#t~ite5_Out-1675012109|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1675012109|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675012109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1675012109} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1675012109|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675012109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1675012109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:05:01,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In-736413263 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-736413263 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-736413263 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-736413263 256) 0))) (or (and (= ~z$w_buff1_used~0_In-736413263 |P0Thread1of1ForFork0_#t~ite6_Out-736413263|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-736413263|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-736413263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-736413263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736413263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-736413263} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-736413263|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-736413263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-736413263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736413263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-736413263} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:05:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In875675962 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In875675962 256))) (.cse2 (= ~z$r_buff0_thd1~0_In875675962 ~z$r_buff0_thd1~0_Out875675962))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out875675962)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In875675962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In875675962} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In875675962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out875675962|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out875675962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:05:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1857803482 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1857803482 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1857803482 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1857803482 256) 0))) (or (and (= ~z$r_buff1_thd1~0_In1857803482 |P0Thread1of1ForFork0_#t~ite8_Out1857803482|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1857803482|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1857803482, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1857803482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857803482, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1857803482} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1857803482, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1857803482|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1857803482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857803482, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1857803482} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:05:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:05:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In354752223 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In354752223 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out354752223| |P2Thread1of1ForFork2_#t~ite38_Out354752223|))) (or (and (= ~z$w_buff1~0_In354752223 |P2Thread1of1ForFork2_#t~ite38_Out354752223|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In354752223 |P2Thread1of1ForFork2_#t~ite38_Out354752223|) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354752223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354752223, ~z$w_buff1~0=~z$w_buff1~0_In354752223, ~z~0=~z~0_In354752223} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354752223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354752223, ~z$w_buff1~0=~z$w_buff1~0_In354752223, ~z~0=~z~0_In354752223, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out354752223|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out354752223|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 17:05:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1901767841 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1901767841 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1901767841| 0)) (and (= ~z$w_buff0_used~0_In1901767841 |P2Thread1of1ForFork2_#t~ite40_Out1901767841|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1901767841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1901767841} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1901767841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1901767841, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1901767841|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 17:05:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1308908359 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1308908359 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1308908359 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1308908359 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1308908359|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out-1308908359| ~z$w_buff1_used~0_In-1308908359)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1308908359, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1308908359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1308908359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1308908359} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1308908359|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1308908359, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1308908359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1308908359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1308908359} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 17:05:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-239285138 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-239285138 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-239285138| ~z$r_buff0_thd3~0_In-239285138) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-239285138| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-239285138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-239285138} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-239285138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-239285138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-239285138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 17:05:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-12763244 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-12763244 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-12763244 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-12763244 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out-12763244| ~z$r_buff1_thd3~0_In-12763244)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite43_Out-12763244| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-12763244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-12763244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12763244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-12763244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-12763244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-12763244, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-12763244|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12763244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-12763244} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 17:05:01,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:05:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:05:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1569616202 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1569616202 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1569616202| |ULTIMATE.start_main_#t~ite47_Out-1569616202|))) (or (and (= ~z$w_buff1~0_In-1569616202 |ULTIMATE.start_main_#t~ite47_Out-1569616202|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-1569616202 |ULTIMATE.start_main_#t~ite47_Out-1569616202|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1569616202, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1569616202, ~z$w_buff1~0=~z$w_buff1~0_In-1569616202, ~z~0=~z~0_In-1569616202} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1569616202, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1569616202|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1569616202, ~z$w_buff1~0=~z$w_buff1~0_In-1569616202, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1569616202|, ~z~0=~z~0_In-1569616202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 17:05:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-174543520 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-174543520 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-174543520 |ULTIMATE.start_main_#t~ite49_Out-174543520|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-174543520|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174543520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174543520} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174543520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174543520, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-174543520|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:05:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1531763723 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1531763723 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1531763723 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1531763723 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1531763723| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1531763723 |ULTIMATE.start_main_#t~ite50_Out1531763723|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531763723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531763723, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531763723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531763723} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1531763723|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531763723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531763723, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531763723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531763723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:05:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1735841075 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1735841075 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1735841075|)) (and (= ~z$r_buff0_thd0~0_In-1735841075 |ULTIMATE.start_main_#t~ite51_Out-1735841075|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735841075, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735841075} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735841075, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1735841075|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735841075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:05:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2102093490 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2102093490 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2102093490 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2102093490 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2102093490|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In2102093490 |ULTIMATE.start_main_#t~ite52_Out2102093490|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2102093490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2102093490, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2102093490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2102093490} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2102093490|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2102093490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2102093490, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2102093490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2102093490} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:05:01,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:05:01,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:05:01 BasicIcfg [2019-12-07 17:05:01,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:05:01,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:05:01,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:05:01,492 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:05:01,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:02:42" (3/4) ... [2019-12-07 17:05:01,494 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:05:01,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26|)) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_26|) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26|) |v_ULTIMATE.start_main_~#t2287~0.offset_19| 0))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_26| 4)) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_19|) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_26|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:05:01,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-07 17:05:01,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491)) (= |P0Thread1of1ForFork0_#in~arg.offset_In974088491| P0Thread1of1ForFork0_~arg.offset_Out974088491) (= ~z$w_buff0~0_Out974088491 1) (= P0Thread1of1ForFork0_~arg.base_Out974088491 |P0Thread1of1ForFork0_#in~arg.base_In974088491|) (= ~z$w_buff1~0_Out974088491 ~z$w_buff0~0_In974088491) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out974088491 256))) (not (= (mod ~z$w_buff0_used~0_Out974088491 256) 0)))) 1 0)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491) (= 1 ~z$w_buff0_used~0_Out974088491) (= ~z$w_buff0_used~0_In974088491 ~z$w_buff1_used~0_Out974088491)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In974088491|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974088491, ~z$w_buff0~0=~z$w_buff0~0_In974088491, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In974088491|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In974088491|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out974088491, ~z$w_buff0~0=~z$w_buff0~0_Out974088491, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out974088491, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out974088491, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In974088491|, ~z$w_buff1~0=~z$w_buff1~0_Out974088491, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out974088491, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out974088491|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out974088491} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:05:01,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-07 17:05:01,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1377813716 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1377813716 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out-1377813716| |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1377813716 |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|) .cse2) (and (= ~z~0_In-1377813716 |P1Thread1of1ForFork1_#t~ite9_Out-1377813716|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1377813716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1377813716, ~z$w_buff1~0=~z$w_buff1~0_In-1377813716, ~z~0=~z~0_In-1377813716} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1377813716|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1377813716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1377813716, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1377813716|, ~z$w_buff1~0=~z$w_buff1~0_In-1377813716, ~z~0=~z~0_In-1377813716} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 17:05:01,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1134272488 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1134272488 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1134272488| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1134272488| ~z$w_buff0_used~0_In1134272488)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1134272488, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1134272488} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1134272488, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1134272488|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1134272488} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 17:05:01,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-545988864 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-545988864 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-545988864 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-545988864 256)))) (or (and (= ~z$w_buff1_used~0_In-545988864 |P1Thread1of1ForFork1_#t~ite12_Out-545988864|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-545988864|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-545988864, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-545988864, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545988864, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-545988864} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-545988864, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-545988864, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545988864, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-545988864|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-545988864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 17:05:01,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1047871323 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1047871323 256)))) (or (and (= ~z$r_buff0_thd2~0_In1047871323 |P1Thread1of1ForFork1_#t~ite13_Out1047871323|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1047871323| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1047871323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1047871323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1047871323, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1047871323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1047871323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 17:05:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1073800007 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1073800007| |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1073800007 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1073800007 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1073800007 256)) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In-1073800007 256) 0) .cse0))) .cse1 (= ~z$w_buff1~0_In-1073800007 |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|)) (and (= ~z$w_buff1~0_In-1073800007 |P2Thread1of1ForFork2_#t~ite24_Out-1073800007|) (= |P2Thread1of1ForFork2_#t~ite23_In-1073800007| |P2Thread1of1ForFork2_#t~ite23_Out-1073800007|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1073800007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1073800007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1073800007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1073800007, ~z$w_buff1~0=~z$w_buff1~0_In-1073800007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1073800007, ~weak$$choice2~0=~weak$$choice2~0_In-1073800007} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1073800007|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1073800007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1073800007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1073800007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1073800007, ~z$w_buff1~0=~z$w_buff1~0_In-1073800007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1073800007, ~weak$$choice2~0=~weak$$choice2~0_In-1073800007} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 17:05:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In974507265 256) 0))) (or (and (= ~z$w_buff0_used~0_In974507265 |P2Thread1of1ForFork2_#t~ite27_Out974507265|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In974507265| |P2Thread1of1ForFork2_#t~ite26_Out974507265|)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out974507265| |P2Thread1of1ForFork2_#t~ite27_Out974507265|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In974507265 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In974507265 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In974507265 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In974507265 256))))) (= ~z$w_buff0_used~0_In974507265 |P2Thread1of1ForFork2_#t~ite26_Out974507265|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In974507265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974507265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In974507265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In974507265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In974507265, ~weak$$choice2~0=~weak$$choice2~0_In974507265} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out974507265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In974507265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In974507265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In974507265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In974507265, ~weak$$choice2~0=~weak$$choice2~0_In974507265, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out974507265|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 17:05:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1048776956 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1048776956 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1048776956 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1048776956 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1048776956|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1048776956 |P1Thread1of1ForFork1_#t~ite14_Out1048776956|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1048776956, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1048776956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1048776956, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1048776956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1048776956, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1048776956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1048776956, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1048776956|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1048776956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:05:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:05:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1371325201 256) 0))) (or (and (= ~z$w_buff1_used~0_In1371325201 |P2Thread1of1ForFork2_#t~ite30_Out1371325201|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In1371325201| |P2Thread1of1ForFork2_#t~ite29_Out1371325201|)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out1371325201| ~z$w_buff1_used~0_In1371325201) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1371325201 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1371325201 256))) (= (mod ~z$w_buff0_used~0_In1371325201 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1371325201 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out1371325201| |P2Thread1of1ForFork2_#t~ite30_Out1371325201|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1371325201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1371325201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371325201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1371325201, ~weak$$choice2~0=~weak$$choice2~0_In1371325201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1371325201|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1371325201|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1371325201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1371325201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371325201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1371325201, ~weak$$choice2~0=~weak$$choice2~0_In1371325201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1371325201|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 17:05:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 17:05:01,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:05:01,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1675012109 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1675012109 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1675012109 |P0Thread1of1ForFork0_#t~ite5_Out-1675012109|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1675012109|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675012109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1675012109} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1675012109|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1675012109, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1675012109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:05:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In-736413263 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-736413263 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-736413263 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-736413263 256) 0))) (or (and (= ~z$w_buff1_used~0_In-736413263 |P0Thread1of1ForFork0_#t~ite6_Out-736413263|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-736413263|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-736413263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-736413263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736413263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-736413263} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-736413263|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-736413263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-736413263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736413263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-736413263} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:05:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In875675962 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In875675962 256))) (.cse2 (= ~z$r_buff0_thd1~0_In875675962 ~z$r_buff0_thd1~0_Out875675962))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out875675962)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In875675962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In875675962} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In875675962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out875675962|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out875675962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:05:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1857803482 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1857803482 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1857803482 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1857803482 256) 0))) (or (and (= ~z$r_buff1_thd1~0_In1857803482 |P0Thread1of1ForFork0_#t~ite8_Out1857803482|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1857803482|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1857803482, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1857803482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857803482, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1857803482} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1857803482, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1857803482|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1857803482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857803482, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1857803482} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:05:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:05:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In354752223 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In354752223 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite39_Out354752223| |P2Thread1of1ForFork2_#t~ite38_Out354752223|))) (or (and (= ~z$w_buff1~0_In354752223 |P2Thread1of1ForFork2_#t~ite38_Out354752223|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In354752223 |P2Thread1of1ForFork2_#t~ite38_Out354752223|) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354752223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354752223, ~z$w_buff1~0=~z$w_buff1~0_In354752223, ~z~0=~z~0_In354752223} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In354752223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354752223, ~z$w_buff1~0=~z$w_buff1~0_In354752223, ~z~0=~z~0_In354752223, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out354752223|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out354752223|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 17:05:01,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1901767841 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1901767841 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1901767841| 0)) (and (= ~z$w_buff0_used~0_In1901767841 |P2Thread1of1ForFork2_#t~ite40_Out1901767841|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1901767841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1901767841} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1901767841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1901767841, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1901767841|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 17:05:01,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1308908359 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1308908359 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1308908359 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1308908359 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1308908359|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out-1308908359| ~z$w_buff1_used~0_In-1308908359)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1308908359, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1308908359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1308908359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1308908359} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1308908359|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1308908359, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1308908359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1308908359, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1308908359} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 17:05:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-239285138 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-239285138 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-239285138| ~z$r_buff0_thd3~0_In-239285138) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-239285138| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-239285138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-239285138} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-239285138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-239285138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-239285138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 17:05:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-12763244 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-12763244 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-12763244 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-12763244 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out-12763244| ~z$r_buff1_thd3~0_In-12763244)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite43_Out-12763244| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-12763244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-12763244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12763244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-12763244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-12763244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-12763244, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-12763244|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12763244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-12763244} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 17:05:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:05:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:05:01,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1569616202 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1569616202 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1569616202| |ULTIMATE.start_main_#t~ite47_Out-1569616202|))) (or (and (= ~z$w_buff1~0_In-1569616202 |ULTIMATE.start_main_#t~ite47_Out-1569616202|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-1569616202 |ULTIMATE.start_main_#t~ite47_Out-1569616202|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1569616202, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1569616202, ~z$w_buff1~0=~z$w_buff1~0_In-1569616202, ~z~0=~z~0_In-1569616202} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1569616202, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1569616202|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1569616202, ~z$w_buff1~0=~z$w_buff1~0_In-1569616202, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1569616202|, ~z~0=~z~0_In-1569616202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 17:05:01,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-174543520 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-174543520 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-174543520 |ULTIMATE.start_main_#t~ite49_Out-174543520|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-174543520|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174543520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174543520} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174543520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174543520, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-174543520|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:05:01,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1531763723 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1531763723 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1531763723 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1531763723 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1531763723| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1531763723 |ULTIMATE.start_main_#t~ite50_Out1531763723|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531763723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531763723, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531763723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531763723} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1531763723|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1531763723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1531763723, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531763723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531763723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:05:01,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1735841075 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1735841075 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1735841075|)) (and (= ~z$r_buff0_thd0~0_In-1735841075 |ULTIMATE.start_main_#t~ite51_Out-1735841075|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735841075, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735841075} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735841075, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1735841075|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735841075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:05:01,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2102093490 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2102093490 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2102093490 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2102093490 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2102093490|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In2102093490 |ULTIMATE.start_main_#t~ite52_Out2102093490|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2102093490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2102093490, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2102093490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2102093490} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2102093490|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2102093490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2102093490, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2102093490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2102093490} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:05:01,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:05:01,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bfbd6a12-a874-4220-90e9-617a975a3d99/bin/utaipan/witness.graphml [2019-12-07 17:05:01,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:05:01,558 INFO L168 Benchmark]: Toolchain (without parser) took 139496.32 ms. Allocated memory was 1.0 GB in the beginning and 8.3 GB in the end (delta: 7.3 GB). Free memory was 938.8 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,558 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:05:01,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,559 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:05:01,559 INFO L168 Benchmark]: RCFGBuilder took 402.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,559 INFO L168 Benchmark]: TraceAbstraction took 138593.05 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.2 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,559 INFO L168 Benchmark]: Witness Printer took 65.20 ms. Allocated memory is still 8.3 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:05:01,561 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 138593.05 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.2 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 65.20 ms. Allocated memory is still 8.3 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 138.4s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 38.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6918 SDtfs, 8622 SDslu, 21932 SDs, 0 SdLazy, 19992 SolverSat, 497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 52 SyntacticMatches, 25 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8279 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294588occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 78.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 402778 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1107 ConstructedInterpolants, 0 QuantifiedInterpolants, 285671 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...