./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/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 5c335ff5b8eab9ea6afa4a9f4426aa1c270baaeb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:15:30,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:15:30,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:15:30,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:15:30,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:15:30,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:15:30,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:15:30,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:15:30,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:15:30,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:15:30,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:15:30,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:15:30,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:15:30,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:15:30,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:15:30,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:15:30,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:15:30,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:15:30,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:15:30,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:15:30,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:15:30,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:15:30,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:15:30,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:15:30,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:15:30,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:15:30,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:15:30,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:15:30,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:15:30,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:15:30,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:15:30,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:15:30,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:15:30,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:15:30,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:15:30,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:15:30,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:15:30,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:15:30,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:15:30,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:15:30,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:15:30,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:15:30,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:15:30,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:15:30,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:15:30,418 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:15:30,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:15:30,419 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:15:30,420 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:15:30,420 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:15:30,420 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:15:30,420 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:15:30,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:15:30,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:15:30,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:15:30,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:15:30,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:15:30,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:15:30,424 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_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/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 -> 5c335ff5b8eab9ea6afa4a9f4426aa1c270baaeb [2019-12-07 13:15:30,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:15:30,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:15:30,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:15:30,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:15:30,535 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:15:30,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i [2019-12-07 13:15:30,573 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/data/ac73240a9/388e6ba709684a99be0f484c0e12f333/FLAG5e2c8aa76 [2019-12-07 13:15:30,949 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:15:30,950 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i [2019-12-07 13:15:30,960 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/data/ac73240a9/388e6ba709684a99be0f484c0e12f333/FLAG5e2c8aa76 [2019-12-07 13:15:30,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/data/ac73240a9/388e6ba709684a99be0f484c0e12f333 [2019-12-07 13:15:30,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:15:30,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:15:30,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:15:30,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:15:30,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:15:30,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:30" (1/1) ... [2019-12-07 13:15:30,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:30, skipping insertion in model container [2019-12-07 13:15:30,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:30" (1/1) ... [2019-12-07 13:15:30,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:15:31,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:15:31,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:15:31,310 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:15:31,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:15:31,421 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:15:31,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31 WrapperNode [2019-12-07 13:15:31,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:15:31,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:15:31,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:15:31,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:15:31,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:15:31,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:15:31,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:15:31,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:15:31,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... [2019-12-07 13:15:31,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:15:31,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:15:31,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:15:31,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:15:31,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/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 13:15:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:15:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:15:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:15:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:15:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:15:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:15:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:15:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:15:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:15:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:15:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:15:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:15:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:15:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:15:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:15:31,529 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 13:15:31,879 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:15:31,879 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:15:31,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:31 BoogieIcfgContainer [2019-12-07 13:15:31,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:15:31,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:15:31,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:15:31,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:15:31,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:15:30" (1/3) ... [2019-12-07 13:15:31,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61020e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:31, skipping insertion in model container [2019-12-07 13:15:31,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:31" (2/3) ... [2019-12-07 13:15:31,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61020e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:31, skipping insertion in model container [2019-12-07 13:15:31,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:31" (3/3) ... [2019-12-07 13:15:31,884 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-07 13:15:31,891 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:15:31,891 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:15:31,895 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:15:31,896 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:15:31,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,922 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,937 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:15:31,955 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:15:31,972 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:15:31,972 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:15:31,973 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:15:31,973 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:15:31,973 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:15:31,973 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:15:31,973 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:15:31,973 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:15:31,984 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-07 13:15:31,985 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 13:15:32,041 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 13:15:32,041 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:15:32,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 715 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 13:15:32,068 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 13:15:32,107 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 13:15:32,108 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:15:32,114 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 715 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 13:15:32,129 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 13:15:32,130 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:15:35,438 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 13:15:35,708 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:15:35,807 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-07 13:15:35,807 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:15:35,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-07 13:16:02,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-07 13:16:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-07 13:16:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:16:02,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:16:02,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:16:02,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:16:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:16:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-07 13:16:02,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:16:02,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220355450] [2019-12-07 13:16:02,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:16:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:16:02,639 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 13:16:02,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220355450] [2019-12-07 13:16:02,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:16:02,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:16:02,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177966570] [2019-12-07 13:16:02,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:16:02,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:16:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:16:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:16:02,654 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-07 13:16:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:16:03,555 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-07 13:16:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:16:03,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:16:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:16:05,939 INFO L225 Difference]: With dead ends: 158106 [2019-12-07 13:16:05,939 INFO L226 Difference]: Without dead ends: 149058 [2019-12-07 13:16:05,940 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 13:16:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-07 13:16:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-07 13:16:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-07 13:16:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-07 13:16:14,311 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-07 13:16:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:16:14,312 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-07 13:16:14,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:16:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-07 13:16:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:16:14,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:16:14,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:16:14,321 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:16:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:16:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-07 13:16:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:16:14,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545691404] [2019-12-07 13:16:14,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:16:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:16:14,381 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 13:16:14,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545691404] [2019-12-07 13:16:14,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:16:14,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:16:14,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289743245] [2019-12-07 13:16:14,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:16:14,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:16:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:16:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:16:14,383 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-07 13:16:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:16:18,060 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-07 13:16:18,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:16:18,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:16:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:16:18,765 INFO L225 Difference]: With dead ends: 235386 [2019-12-07 13:16:18,765 INFO L226 Difference]: Without dead ends: 235190 [2019-12-07 13:16:18,765 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 13:16:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-07 13:16:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-07 13:16:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-07 13:16:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-07 13:16:29,770 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-07 13:16:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:16:29,771 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-07 13:16:29,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:16:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-07 13:16:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:16:29,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:16:29,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:16:29,774 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:16:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:16:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-07 13:16:29,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:16:29,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589557800] [2019-12-07 13:16:29,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:16:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:16:29,822 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 13:16:29,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589557800] [2019-12-07 13:16:29,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:16:29,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:16:29,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550077814] [2019-12-07 13:16:29,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:16:29,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:16:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:16:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:16:29,824 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 4 states. [2019-12-07 13:16:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:16:31,510 INFO L93 Difference]: Finished difference Result 303492 states and 1373977 transitions. [2019-12-07 13:16:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:16:31,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:16:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:16:35,636 INFO L225 Difference]: With dead ends: 303492 [2019-12-07 13:16:35,637 INFO L226 Difference]: Without dead ends: 303268 [2019-12-07 13:16:35,637 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 13:16:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303268 states. [2019-12-07 13:16:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303268 to 258620. [2019-12-07 13:16:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258620 states. [2019-12-07 13:16:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258620 states to 258620 states and 1186875 transitions. [2019-12-07 13:16:47,991 INFO L78 Accepts]: Start accepts. Automaton has 258620 states and 1186875 transitions. Word has length 15 [2019-12-07 13:16:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:16:47,992 INFO L462 AbstractCegarLoop]: Abstraction has 258620 states and 1186875 transitions. [2019-12-07 13:16:47,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:16:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 258620 states and 1186875 transitions. [2019-12-07 13:16:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:16:47,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:16:47,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:16:47,997 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:16:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:16:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-07 13:16:47,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:16:47,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9462197] [2019-12-07 13:16:47,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:16:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:16:48,053 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 13:16:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9462197] [2019-12-07 13:16:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:16:48,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:16:48,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267097836] [2019-12-07 13:16:48,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:16:48,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:16:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:16:48,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:16:48,055 INFO L87 Difference]: Start difference. First operand 258620 states and 1186875 transitions. Second operand 4 states. [2019-12-07 13:16:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:16:50,378 INFO L93 Difference]: Finished difference Result 318782 states and 1453762 transitions. [2019-12-07 13:16:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:16:50,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:16:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:16:51,279 INFO L225 Difference]: With dead ends: 318782 [2019-12-07 13:16:51,279 INFO L226 Difference]: Without dead ends: 318590 [2019-12-07 13:16:51,280 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 13:17:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318590 states. [2019-12-07 13:17:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318590 to 272736. [2019-12-07 13:17:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272736 states. [2019-12-07 13:17:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272736 states to 272736 states and 1251733 transitions. [2019-12-07 13:17:07,946 INFO L78 Accepts]: Start accepts. Automaton has 272736 states and 1251733 transitions. Word has length 16 [2019-12-07 13:17:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:07,946 INFO L462 AbstractCegarLoop]: Abstraction has 272736 states and 1251733 transitions. [2019-12-07 13:17:07,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 272736 states and 1251733 transitions. [2019-12-07 13:17:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:17:07,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:07,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:07,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 481033317, now seen corresponding path program 1 times [2019-12-07 13:17:07,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:07,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268826092] [2019-12-07 13:17:07,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:08,023 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 13:17:08,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268826092] [2019-12-07 13:17:08,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:08,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:08,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182093132] [2019-12-07 13:17:08,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:08,024 INFO L87 Difference]: Start difference. First operand 272736 states and 1251733 transitions. Second operand 3 states. [2019-12-07 13:17:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:09,931 INFO L93 Difference]: Finished difference Result 274234 states and 1256012 transitions. [2019-12-07 13:17:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:09,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:17:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:10,708 INFO L225 Difference]: With dead ends: 274234 [2019-12-07 13:17:10,709 INFO L226 Difference]: Without dead ends: 274234 [2019-12-07 13:17:10,709 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 13:17:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274234 states. [2019-12-07 13:17:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274234 to 272647. [2019-12-07 13:17:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272647 states. [2019-12-07 13:17:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272647 states to 272647 states and 1251268 transitions. [2019-12-07 13:17:26,235 INFO L78 Accepts]: Start accepts. Automaton has 272647 states and 1251268 transitions. Word has length 20 [2019-12-07 13:17:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:26,236 INFO L462 AbstractCegarLoop]: Abstraction has 272647 states and 1251268 transitions. [2019-12-07 13:17:26,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 272647 states and 1251268 transitions. [2019-12-07 13:17:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:17:26,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:26,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:26,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 909864239, now seen corresponding path program 1 times [2019-12-07 13:17:26,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:26,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023120535] [2019-12-07 13:17:26,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:26,298 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 13:17:26,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023120535] [2019-12-07 13:17:26,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:26,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:26,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202178949] [2019-12-07 13:17:26,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:26,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:26,299 INFO L87 Difference]: Start difference. First operand 272647 states and 1251268 transitions. Second operand 3 states. [2019-12-07 13:17:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:28,057 INFO L93 Difference]: Finished difference Result 257167 states and 1168646 transitions. [2019-12-07 13:17:28,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:28,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 13:17:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:28,775 INFO L225 Difference]: With dead ends: 257167 [2019-12-07 13:17:28,775 INFO L226 Difference]: Without dead ends: 257167 [2019-12-07 13:17:28,775 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 13:17:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257167 states. [2019-12-07 13:17:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257167 to 253407. [2019-12-07 13:17:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253407 states. [2019-12-07 13:17:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253407 states to 253407 states and 1152462 transitions. [2019-12-07 13:17:43,165 INFO L78 Accepts]: Start accepts. Automaton has 253407 states and 1152462 transitions. Word has length 21 [2019-12-07 13:17:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,165 INFO L462 AbstractCegarLoop]: Abstraction has 253407 states and 1152462 transitions. [2019-12-07 13:17:43,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 253407 states and 1152462 transitions. [2019-12-07 13:17:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:17:43,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1351598936, now seen corresponding path program 1 times [2019-12-07 13:17:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:43,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024625031] [2019-12-07 13:17:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,237 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 13:17:43,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024625031] [2019-12-07 13:17:43,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774790342] [2019-12-07 13:17:43,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:43,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:43,239 INFO L87 Difference]: Start difference. First operand 253407 states and 1152462 transitions. Second operand 4 states. [2019-12-07 13:17:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:44,476 INFO L93 Difference]: Finished difference Result 253484 states and 1150388 transitions. [2019-12-07 13:17:44,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:17:44,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:17:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:45,783 INFO L225 Difference]: With dead ends: 253484 [2019-12-07 13:17:45,783 INFO L226 Difference]: Without dead ends: 253484 [2019-12-07 13:17:45,784 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 13:17:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253484 states. [2019-12-07 13:17:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253484 to 251958. [2019-12-07 13:17:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251958 states. [2019-12-07 13:17:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251958 states to 251958 states and 1145806 transitions. [2019-12-07 13:17:56,810 INFO L78 Accepts]: Start accepts. Automaton has 251958 states and 1145806 transitions. Word has length 21 [2019-12-07 13:17:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:56,811 INFO L462 AbstractCegarLoop]: Abstraction has 251958 states and 1145806 transitions. [2019-12-07 13:17:56,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 251958 states and 1145806 transitions. [2019-12-07 13:17:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:17:56,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:56,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:56,833 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2073534819, now seen corresponding path program 1 times [2019-12-07 13:17:56,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:56,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804947438] [2019-12-07 13:17:56,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:56,872 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 13:17:56,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804947438] [2019-12-07 13:17:56,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:56,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:56,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247706151] [2019-12-07 13:17:56,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:17:56,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:56,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:17:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:56,874 INFO L87 Difference]: Start difference. First operand 251958 states and 1145806 transitions. Second operand 5 states. [2019-12-07 13:18:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:02,946 INFO L93 Difference]: Finished difference Result 355214 states and 1594184 transitions. [2019-12-07 13:18:02,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:18:02,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 13:18:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:03,917 INFO L225 Difference]: With dead ends: 355214 [2019-12-07 13:18:03,917 INFO L226 Difference]: Without dead ends: 354848 [2019-12-07 13:18:03,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:18:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354848 states. [2019-12-07 13:18:16,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354848 to 264268. [2019-12-07 13:18:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264268 states. [2019-12-07 13:18:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264268 states to 264268 states and 1201645 transitions. [2019-12-07 13:18:17,002 INFO L78 Accepts]: Start accepts. Automaton has 264268 states and 1201645 transitions. Word has length 21 [2019-12-07 13:18:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:17,002 INFO L462 AbstractCegarLoop]: Abstraction has 264268 states and 1201645 transitions. [2019-12-07 13:18:17,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:18:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 264268 states and 1201645 transitions. [2019-12-07 13:18:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:18:17,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:17,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:18:17,023 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -814273925, now seen corresponding path program 1 times [2019-12-07 13:18:17,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:17,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474752738] [2019-12-07 13:18:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:17,048 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 13:18:17,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474752738] [2019-12-07 13:18:17,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:17,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:18:17,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408605365] [2019-12-07 13:18:17,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:18:17,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:18:17,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:18:17,049 INFO L87 Difference]: Start difference. First operand 264268 states and 1201645 transitions. Second operand 3 states. [2019-12-07 13:18:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:18,217 INFO L93 Difference]: Finished difference Result 163119 states and 666779 transitions. [2019-12-07 13:18:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:18:18,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 13:18:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:18,610 INFO L225 Difference]: With dead ends: 163119 [2019-12-07 13:18:18,610 INFO L226 Difference]: Without dead ends: 163119 [2019-12-07 13:18:18,610 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 13:18:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163119 states. [2019-12-07 13:18:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163119 to 163119. [2019-12-07 13:18:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163119 states. [2019-12-07 13:18:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163119 states to 163119 states and 666779 transitions. [2019-12-07 13:18:25,270 INFO L78 Accepts]: Start accepts. Automaton has 163119 states and 666779 transitions. Word has length 21 [2019-12-07 13:18:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:25,271 INFO L462 AbstractCegarLoop]: Abstraction has 163119 states and 666779 transitions. [2019-12-07 13:18:25,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:18:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 163119 states and 666779 transitions. [2019-12-07 13:18:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:18:25,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:25,286 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 13:18:25,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:25,286 INFO L82 PathProgramCache]: Analyzing trace with hash -405417231, now seen corresponding path program 1 times [2019-12-07 13:18:25,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:25,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153842275] [2019-12-07 13:18:25,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:25,316 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 13:18:25,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153842275] [2019-12-07 13:18:25,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:25,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:18:25,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013777624] [2019-12-07 13:18:25,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:18:25,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:18:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:18:25,317 INFO L87 Difference]: Start difference. First operand 163119 states and 666779 transitions. Second operand 4 states. [2019-12-07 13:18:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:25,471 INFO L93 Difference]: Finished difference Result 42324 states and 146994 transitions. [2019-12-07 13:18:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:18:25,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 13:18:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:25,541 INFO L225 Difference]: With dead ends: 42324 [2019-12-07 13:18:25,541 INFO L226 Difference]: Without dead ends: 42324 [2019-12-07 13:18:25,541 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 13:18:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42324 states. [2019-12-07 13:18:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42324 to 42324. [2019-12-07 13:18:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42324 states. [2019-12-07 13:18:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42324 states to 42324 states and 146994 transitions. [2019-12-07 13:18:26,253 INFO L78 Accepts]: Start accepts. Automaton has 42324 states and 146994 transitions. Word has length 22 [2019-12-07 13:18:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:26,253 INFO L462 AbstractCegarLoop]: Abstraction has 42324 states and 146994 transitions. [2019-12-07 13:18:26,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:18:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 42324 states and 146994 transitions. [2019-12-07 13:18:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:18:26,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:26,262 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] [2019-12-07 13:18:26,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-07 13:18:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196246124] [2019-12-07 13:18:26,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:26,299 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 13:18:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196246124] [2019-12-07 13:18:26,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:26,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:18:26,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176557670] [2019-12-07 13:18:26,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:18:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:18:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:18:26,300 INFO L87 Difference]: Start difference. First operand 42324 states and 146994 transitions. Second operand 5 states. [2019-12-07 13:18:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:27,026 INFO L93 Difference]: Finished difference Result 54644 states and 187177 transitions. [2019-12-07 13:18:27,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:18:27,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 13:18:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:27,118 INFO L225 Difference]: With dead ends: 54644 [2019-12-07 13:18:27,118 INFO L226 Difference]: Without dead ends: 54620 [2019-12-07 13:18:27,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:18:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54620 states. [2019-12-07 13:18:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54620 to 43245. [2019-12-07 13:18:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43245 states. [2019-12-07 13:18:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43245 states to 43245 states and 149717 transitions. [2019-12-07 13:18:27,924 INFO L78 Accepts]: Start accepts. Automaton has 43245 states and 149717 transitions. Word has length 24 [2019-12-07 13:18:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:27,924 INFO L462 AbstractCegarLoop]: Abstraction has 43245 states and 149717 transitions. [2019-12-07 13:18:27,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:18:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 43245 states and 149717 transitions. [2019-12-07 13:18:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:18:27,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:27,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:18:27,943 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1513171326, now seen corresponding path program 1 times [2019-12-07 13:18:27,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:27,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222396780] [2019-12-07 13:18:27,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:28,002 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 13:18:28,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222396780] [2019-12-07 13:18:28,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:28,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:18:28,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844952413] [2019-12-07 13:18:28,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:18:28,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:18:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:18:28,003 INFO L87 Difference]: Start difference. First operand 43245 states and 149717 transitions. Second operand 6 states. [2019-12-07 13:18:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:28,750 INFO L93 Difference]: Finished difference Result 112105 states and 389808 transitions. [2019-12-07 13:18:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:18:28,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 13:18:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:28,962 INFO L225 Difference]: With dead ends: 112105 [2019-12-07 13:18:28,962 INFO L226 Difference]: Without dead ends: 112058 [2019-12-07 13:18:28,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:18:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112058 states. [2019-12-07 13:18:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112058 to 56574. [2019-12-07 13:18:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56574 states. [2019-12-07 13:18:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56574 states to 56574 states and 198346 transitions. [2019-12-07 13:18:30,553 INFO L78 Accepts]: Start accepts. Automaton has 56574 states and 198346 transitions. Word has length 31 [2019-12-07 13:18:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:30,553 INFO L462 AbstractCegarLoop]: Abstraction has 56574 states and 198346 transitions. [2019-12-07 13:18:30,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:18:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56574 states and 198346 transitions. [2019-12-07 13:18:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:18:30,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:30,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:18:30,586 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1748073813, now seen corresponding path program 1 times [2019-12-07 13:18:30,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:30,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755057691] [2019-12-07 13:18:30,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:30,622 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 13:18:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755057691] [2019-12-07 13:18:30,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:30,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:18:30,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127815426] [2019-12-07 13:18:30,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:18:30,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:18:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:18:30,624 INFO L87 Difference]: Start difference. First operand 56574 states and 198346 transitions. Second operand 5 states. [2019-12-07 13:18:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:30,741 INFO L93 Difference]: Finished difference Result 29198 states and 105441 transitions. [2019-12-07 13:18:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:18:30,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 13:18:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:30,796 INFO L225 Difference]: With dead ends: 29198 [2019-12-07 13:18:30,796 INFO L226 Difference]: Without dead ends: 29198 [2019-12-07 13:18:30,797 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 13:18:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29198 states. [2019-12-07 13:18:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29198 to 27390. [2019-12-07 13:18:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27390 states. [2019-12-07 13:18:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27390 states to 27390 states and 98911 transitions. [2019-12-07 13:18:31,263 INFO L78 Accepts]: Start accepts. Automaton has 27390 states and 98911 transitions. Word has length 32 [2019-12-07 13:18:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:31,263 INFO L462 AbstractCegarLoop]: Abstraction has 27390 states and 98911 transitions. [2019-12-07 13:18:31,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:18:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27390 states and 98911 transitions. [2019-12-07 13:18:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:18:31,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:31,298 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] [2019-12-07 13:18:31,298 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:31,299 INFO L82 PathProgramCache]: Analyzing trace with hash 328211609, now seen corresponding path program 1 times [2019-12-07 13:18:31,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:31,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841711611] [2019-12-07 13:18:31,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:31,346 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 13:18:31,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841711611] [2019-12-07 13:18:31,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:31,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:18:31,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183591342] [2019-12-07 13:18:31,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:18:31,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:31,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:18:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:18:31,348 INFO L87 Difference]: Start difference. First operand 27390 states and 98911 transitions. Second operand 5 states. [2019-12-07 13:18:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:31,777 INFO L93 Difference]: Finished difference Result 40597 states and 145209 transitions. [2019-12-07 13:18:31,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:18:31,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 13:18:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:31,845 INFO L225 Difference]: With dead ends: 40597 [2019-12-07 13:18:31,845 INFO L226 Difference]: Without dead ends: 40597 [2019-12-07 13:18:31,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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 13:18:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40597 states. [2019-12-07 13:18:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40597 to 35183. [2019-12-07 13:18:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35183 states. [2019-12-07 13:18:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35183 states to 35183 states and 126924 transitions. [2019-12-07 13:18:32,508 INFO L78 Accepts]: Start accepts. Automaton has 35183 states and 126924 transitions. Word has length 43 [2019-12-07 13:18:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:32,508 INFO L462 AbstractCegarLoop]: Abstraction has 35183 states and 126924 transitions. [2019-12-07 13:18:32,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:18:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35183 states and 126924 transitions. [2019-12-07 13:18:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:18:32,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:32,550 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] [2019-12-07 13:18:32,551 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1193847249, now seen corresponding path program 2 times [2019-12-07 13:18:32,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:32,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018644015] [2019-12-07 13:18:32,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:32,620 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 13:18:32,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018644015] [2019-12-07 13:18:32,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:32,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:18:32,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802314259] [2019-12-07 13:18:32,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:18:32,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:32,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:18:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:18:32,621 INFO L87 Difference]: Start difference. First operand 35183 states and 126924 transitions. Second operand 4 states. [2019-12-07 13:18:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:32,782 INFO L93 Difference]: Finished difference Result 47355 states and 165135 transitions. [2019-12-07 13:18:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:18:32,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 13:18:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:32,851 INFO L225 Difference]: With dead ends: 47355 [2019-12-07 13:18:32,851 INFO L226 Difference]: Without dead ends: 45649 [2019-12-07 13:18:32,851 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 13:18:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45649 states. [2019-12-07 13:18:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45649 to 44534. [2019-12-07 13:18:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44534 states. [2019-12-07 13:18:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44534 states to 44534 states and 156133 transitions. [2019-12-07 13:18:33,563 INFO L78 Accepts]: Start accepts. Automaton has 44534 states and 156133 transitions. Word has length 43 [2019-12-07 13:18:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:33,563 INFO L462 AbstractCegarLoop]: Abstraction has 44534 states and 156133 transitions. [2019-12-07 13:18:33,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:18:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44534 states and 156133 transitions. [2019-12-07 13:18:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:18:33,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:33,614 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] [2019-12-07 13:18:33,615 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1106941767, now seen corresponding path program 3 times [2019-12-07 13:18:33,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:33,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114465557] [2019-12-07 13:18:33,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:33,651 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 13:18:33,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114465557] [2019-12-07 13:18:33,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:33,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:18:33,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038498432] [2019-12-07 13:18:33,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:18:33,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:33,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:18:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:18:33,652 INFO L87 Difference]: Start difference. First operand 44534 states and 156133 transitions. Second operand 3 states. [2019-12-07 13:18:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:33,879 INFO L93 Difference]: Finished difference Result 44534 states and 154443 transitions. [2019-12-07 13:18:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:18:33,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 13:18:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:33,947 INFO L225 Difference]: With dead ends: 44534 [2019-12-07 13:18:33,947 INFO L226 Difference]: Without dead ends: 44534 [2019-12-07 13:18:33,947 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 13:18:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44534 states. [2019-12-07 13:18:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44534 to 43079. [2019-12-07 13:18:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43079 states. [2019-12-07 13:18:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43079 states to 43079 states and 149684 transitions. [2019-12-07 13:18:34,620 INFO L78 Accepts]: Start accepts. Automaton has 43079 states and 149684 transitions. Word has length 43 [2019-12-07 13:18:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:34,621 INFO L462 AbstractCegarLoop]: Abstraction has 43079 states and 149684 transitions. [2019-12-07 13:18:34,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:18:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43079 states and 149684 transitions. [2019-12-07 13:18:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:18:34,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:34,668 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] [2019-12-07 13:18:34,668 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash -233422742, now seen corresponding path program 1 times [2019-12-07 13:18:34,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:34,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716687668] [2019-12-07 13:18:34,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:34,710 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 13:18:34,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716687668] [2019-12-07 13:18:34,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:34,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:18:34,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819015687] [2019-12-07 13:18:34,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:18:34,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:18:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:18:34,711 INFO L87 Difference]: Start difference. First operand 43079 states and 149684 transitions. Second operand 6 states. [2019-12-07 13:18:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:34,870 INFO L93 Difference]: Finished difference Result 40845 states and 144361 transitions. [2019-12-07 13:18:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:18:34,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 13:18:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:34,938 INFO L225 Difference]: With dead ends: 40845 [2019-12-07 13:18:34,938 INFO L226 Difference]: Without dead ends: 40845 [2019-12-07 13:18:34,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:18:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40845 states. [2019-12-07 13:18:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40845 to 29052. [2019-12-07 13:18:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29052 states. [2019-12-07 13:18:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29052 states to 29052 states and 105751 transitions. [2019-12-07 13:18:35,506 INFO L78 Accepts]: Start accepts. Automaton has 29052 states and 105751 transitions. Word has length 43 [2019-12-07 13:18:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:35,506 INFO L462 AbstractCegarLoop]: Abstraction has 29052 states and 105751 transitions. [2019-12-07 13:18:35,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:18:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29052 states and 105751 transitions. [2019-12-07 13:18:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:35,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:35,542 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] [2019-12-07 13:18:35,543 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1812975080, now seen corresponding path program 1 times [2019-12-07 13:18:35,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593607810] [2019-12-07 13:18:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:35,615 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 13:18:35,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593607810] [2019-12-07 13:18:35,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:35,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:18:35,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975993902] [2019-12-07 13:18:35,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:18:35,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:18:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:18:35,617 INFO L87 Difference]: Start difference. First operand 29052 states and 105751 transitions. Second operand 5 states. [2019-12-07 13:18:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:35,751 INFO L93 Difference]: Finished difference Result 41082 states and 143366 transitions. [2019-12-07 13:18:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:18:35,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 13:18:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:35,795 INFO L225 Difference]: With dead ends: 41082 [2019-12-07 13:18:35,795 INFO L226 Difference]: Without dead ends: 26625 [2019-12-07 13:18:35,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:18:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26625 states. [2019-12-07 13:18:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26625 to 26625. [2019-12-07 13:18:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26625 states. [2019-12-07 13:18:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26625 states to 26625 states and 95555 transitions. [2019-12-07 13:18:36,293 INFO L78 Accepts]: Start accepts. Automaton has 26625 states and 95555 transitions. Word has length 59 [2019-12-07 13:18:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:36,293 INFO L462 AbstractCegarLoop]: Abstraction has 26625 states and 95555 transitions. [2019-12-07 13:18:36,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:18:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 26625 states and 95555 transitions. [2019-12-07 13:18:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:36,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:36,325 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] [2019-12-07 13:18:36,325 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash -185251466, now seen corresponding path program 2 times [2019-12-07 13:18:36,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:36,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113582624] [2019-12-07 13:18:36,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:36,366 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 13:18:36,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113582624] [2019-12-07 13:18:36,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:36,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:18:36,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477644781] [2019-12-07 13:18:36,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:18:36,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:18:36,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:18:36,367 INFO L87 Difference]: Start difference. First operand 26625 states and 95555 transitions. Second operand 4 states. [2019-12-07 13:18:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:36,483 INFO L93 Difference]: Finished difference Result 38279 states and 132097 transitions. [2019-12-07 13:18:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:18:36,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 13:18:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:36,500 INFO L225 Difference]: With dead ends: 38279 [2019-12-07 13:18:36,500 INFO L226 Difference]: Without dead ends: 12480 [2019-12-07 13:18:36,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:18:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12480 states. [2019-12-07 13:18:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12480 to 12480. [2019-12-07 13:18:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12480 states. [2019-12-07 13:18:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12480 states to 12480 states and 38826 transitions. [2019-12-07 13:18:36,676 INFO L78 Accepts]: Start accepts. Automaton has 12480 states and 38826 transitions. Word has length 59 [2019-12-07 13:18:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:36,676 INFO L462 AbstractCegarLoop]: Abstraction has 12480 states and 38826 transitions. [2019-12-07 13:18:36,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:18:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 12480 states and 38826 transitions. [2019-12-07 13:18:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:36,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:36,688 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] [2019-12-07 13:18:36,688 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 530809076, now seen corresponding path program 3 times [2019-12-07 13:18:36,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:36,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115499081] [2019-12-07 13:18:36,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:36,826 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 13:18:36,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115499081] [2019-12-07 13:18:36,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:36,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:18:36,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034093375] [2019-12-07 13:18:36,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:18:36,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:18:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:18:36,827 INFO L87 Difference]: Start difference. First operand 12480 states and 38826 transitions. Second operand 11 states. [2019-12-07 13:18:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:37,594 INFO L93 Difference]: Finished difference Result 23110 states and 71734 transitions. [2019-12-07 13:18:37,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:18:37,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 13:18:37,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:37,612 INFO L225 Difference]: With dead ends: 23110 [2019-12-07 13:18:37,613 INFO L226 Difference]: Without dead ends: 16616 [2019-12-07 13:18:37,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-07 13:18:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16616 states. [2019-12-07 13:18:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16616 to 14585. [2019-12-07 13:18:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14585 states. [2019-12-07 13:18:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14585 states to 14585 states and 45132 transitions. [2019-12-07 13:18:37,828 INFO L78 Accepts]: Start accepts. Automaton has 14585 states and 45132 transitions. Word has length 59 [2019-12-07 13:18:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:37,828 INFO L462 AbstractCegarLoop]: Abstraction has 14585 states and 45132 transitions. [2019-12-07 13:18:37,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:18:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14585 states and 45132 transitions. [2019-12-07 13:18:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:37,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:37,841 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] [2019-12-07 13:18:37,841 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1911038550, now seen corresponding path program 4 times [2019-12-07 13:18:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851538768] [2019-12-07 13:18:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:38,129 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 13:18:38,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851538768] [2019-12-07 13:18:38,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:38,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:18:38,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445809962] [2019-12-07 13:18:38,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:18:38,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:18:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:18:38,130 INFO L87 Difference]: Start difference. First operand 14585 states and 45132 transitions. Second operand 15 states. [2019-12-07 13:18:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:41,872 INFO L93 Difference]: Finished difference Result 21268 states and 64849 transitions. [2019-12-07 13:18:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 13:18:41,873 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-07 13:18:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:41,902 INFO L225 Difference]: With dead ends: 21268 [2019-12-07 13:18:41,903 INFO L226 Difference]: Without dead ends: 19372 [2019-12-07 13:18:41,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2019-12-07 13:18:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19372 states. [2019-12-07 13:18:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19372 to 14865. [2019-12-07 13:18:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14865 states. [2019-12-07 13:18:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14865 states to 14865 states and 45849 transitions. [2019-12-07 13:18:42,184 INFO L78 Accepts]: Start accepts. Automaton has 14865 states and 45849 transitions. Word has length 59 [2019-12-07 13:18:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:42,184 INFO L462 AbstractCegarLoop]: Abstraction has 14865 states and 45849 transitions. [2019-12-07 13:18:42,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:18:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14865 states and 45849 transitions. [2019-12-07 13:18:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:42,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:42,196 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] [2019-12-07 13:18:42,196 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1836198470, now seen corresponding path program 5 times [2019-12-07 13:18:42,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:42,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338440508] [2019-12-07 13:18:42,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:42,320 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 13:18:42,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338440508] [2019-12-07 13:18:42,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:42,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:18:42,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590763988] [2019-12-07 13:18:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:18:42,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:18:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:18:42,321 INFO L87 Difference]: Start difference. First operand 14865 states and 45849 transitions. Second operand 10 states. [2019-12-07 13:18:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:43,751 INFO L93 Difference]: Finished difference Result 21257 states and 65094 transitions. [2019-12-07 13:18:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:18:43,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-07 13:18:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:43,771 INFO L225 Difference]: With dead ends: 21257 [2019-12-07 13:18:43,771 INFO L226 Difference]: Without dead ends: 18062 [2019-12-07 13:18:43,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:18:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18062 states. [2019-12-07 13:18:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18062 to 14936. [2019-12-07 13:18:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-07 13:18:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45968 transitions. [2019-12-07 13:18:44,000 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45968 transitions. Word has length 59 [2019-12-07 13:18:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:44,000 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45968 transitions. [2019-12-07 13:18:44,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:18:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45968 transitions. [2019-12-07 13:18:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:44,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:44,015 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] [2019-12-07 13:18:44,015 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -71911370, now seen corresponding path program 6 times [2019-12-07 13:18:44,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:44,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957140036] [2019-12-07 13:18:44,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:44,315 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 13:18:44,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957140036] [2019-12-07 13:18:44,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:44,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 13:18:44,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049581695] [2019-12-07 13:18:44,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:18:44,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:18:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:18:44,317 INFO L87 Difference]: Start difference. First operand 14936 states and 45968 transitions. Second operand 16 states. [2019-12-07 13:18:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:45,907 INFO L93 Difference]: Finished difference Result 20604 states and 62667 transitions. [2019-12-07 13:18:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 13:18:45,907 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-07 13:18:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:45,928 INFO L225 Difference]: With dead ends: 20604 [2019-12-07 13:18:45,928 INFO L226 Difference]: Without dead ends: 19398 [2019-12-07 13:18:45,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 13:18:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2019-12-07 13:18:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 15050. [2019-12-07 13:18:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15050 states. [2019-12-07 13:18:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15050 states to 15050 states and 46241 transitions. [2019-12-07 13:18:46,163 INFO L78 Accepts]: Start accepts. Automaton has 15050 states and 46241 transitions. Word has length 59 [2019-12-07 13:18:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:46,163 INFO L462 AbstractCegarLoop]: Abstraction has 15050 states and 46241 transitions. [2019-12-07 13:18:46,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:18:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15050 states and 46241 transitions. [2019-12-07 13:18:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:46,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:46,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:18:46,177 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2066909418, now seen corresponding path program 7 times [2019-12-07 13:18:46,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:46,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255158808] [2019-12-07 13:18:46,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:46,282 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 13:18:46,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255158808] [2019-12-07 13:18:46,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:46,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:18:46,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090354953] [2019-12-07 13:18:46,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:18:46,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:18:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:18:46,283 INFO L87 Difference]: Start difference. First operand 15050 states and 46241 transitions. Second operand 11 states. [2019-12-07 13:18:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:46,890 INFO L93 Difference]: Finished difference Result 19756 states and 60402 transitions. [2019-12-07 13:18:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:18:46,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 13:18:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:46,909 INFO L225 Difference]: With dead ends: 19756 [2019-12-07 13:18:46,909 INFO L226 Difference]: Without dead ends: 17321 [2019-12-07 13:18:46,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:18:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17321 states. [2019-12-07 13:18:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17321 to 14681. [2019-12-07 13:18:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14681 states. [2019-12-07 13:18:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14681 states to 14681 states and 45222 transitions. [2019-12-07 13:18:47,132 INFO L78 Accepts]: Start accepts. Automaton has 14681 states and 45222 transitions. Word has length 59 [2019-12-07 13:18:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:47,132 INFO L462 AbstractCegarLoop]: Abstraction has 14681 states and 45222 transitions. [2019-12-07 13:18:47,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:18:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14681 states and 45222 transitions. [2019-12-07 13:18:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:47,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:47,145 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] [2019-12-07 13:18:47,146 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1658578216, now seen corresponding path program 8 times [2019-12-07 13:18:47,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:47,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465935764] [2019-12-07 13:18:47,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:18:47,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465935764] [2019-12-07 13:18:47,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:47,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:18:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502791506] [2019-12-07 13:18:47,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:18:47,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:18:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:18:47,248 INFO L87 Difference]: Start difference. First operand 14681 states and 45222 transitions. Second operand 10 states. [2019-12-07 13:18:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:47,962 INFO L93 Difference]: Finished difference Result 34150 states and 105974 transitions. [2019-12-07 13:18:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 13:18:47,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-07 13:18:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:47,989 INFO L225 Difference]: With dead ends: 34150 [2019-12-07 13:18:47,989 INFO L226 Difference]: Without dead ends: 24371 [2019-12-07 13:18:47,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:18:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24371 states. [2019-12-07 13:18:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24371 to 15359. [2019-12-07 13:18:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15359 states. [2019-12-07 13:18:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15359 states to 15359 states and 47217 transitions. [2019-12-07 13:18:48,264 INFO L78 Accepts]: Start accepts. Automaton has 15359 states and 47217 transitions. Word has length 59 [2019-12-07 13:18:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:48,265 INFO L462 AbstractCegarLoop]: Abstraction has 15359 states and 47217 transitions. [2019-12-07 13:18:48,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:18:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 15359 states and 47217 transitions. [2019-12-07 13:18:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:48,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:48,278 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] [2019-12-07 13:18:48,278 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1816631088, now seen corresponding path program 9 times [2019-12-07 13:18:48,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:48,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943674800] [2019-12-07 13:18:48,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:48,398 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 13:18:48,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943674800] [2019-12-07 13:18:48,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:48,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:18:48,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428962420] [2019-12-07 13:18:48,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:18:48,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:18:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:18:48,399 INFO L87 Difference]: Start difference. First operand 15359 states and 47217 transitions. Second operand 11 states. [2019-12-07 13:18:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:49,246 INFO L93 Difference]: Finished difference Result 27344 states and 83795 transitions. [2019-12-07 13:18:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:18:49,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 13:18:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:49,289 INFO L225 Difference]: With dead ends: 27344 [2019-12-07 13:18:49,289 INFO L226 Difference]: Without dead ends: 23079 [2019-12-07 13:18:49,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:18:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23079 states. [2019-12-07 13:18:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23079 to 15199. [2019-12-07 13:18:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15199 states. [2019-12-07 13:18:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15199 states to 15199 states and 46626 transitions. [2019-12-07 13:18:49,556 INFO L78 Accepts]: Start accepts. Automaton has 15199 states and 46626 transitions. Word has length 59 [2019-12-07 13:18:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:49,556 INFO L462 AbstractCegarLoop]: Abstraction has 15199 states and 46626 transitions. [2019-12-07 13:18:49,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:18:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15199 states and 46626 transitions. [2019-12-07 13:18:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:49,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:49,570 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] [2019-12-07 13:18:49,570 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -152494338, now seen corresponding path program 10 times [2019-12-07 13:18:49,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:49,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562268759] [2019-12-07 13:18:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:49,829 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 13:18:49,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562268759] [2019-12-07 13:18:49,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:49,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 13:18:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430866808] [2019-12-07 13:18:49,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:18:49,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:18:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:18:49,830 INFO L87 Difference]: Start difference. First operand 15199 states and 46626 transitions. Second operand 18 states. [2019-12-07 13:18:53,069 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-12-07 13:18:53,347 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-12-07 13:18:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:54,509 INFO L93 Difference]: Finished difference Result 31372 states and 95394 transitions. [2019-12-07 13:18:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 13:18:54,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-07 13:18:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:54,543 INFO L225 Difference]: With dead ends: 31372 [2019-12-07 13:18:54,543 INFO L226 Difference]: Without dead ends: 27898 [2019-12-07 13:18:54,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 13:18:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27898 states. [2019-12-07 13:18:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27898 to 20082. [2019-12-07 13:18:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20082 states. [2019-12-07 13:18:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20082 states to 20082 states and 61448 transitions. [2019-12-07 13:18:54,910 INFO L78 Accepts]: Start accepts. Automaton has 20082 states and 61448 transitions. Word has length 59 [2019-12-07 13:18:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:54,910 INFO L462 AbstractCegarLoop]: Abstraction has 20082 states and 61448 transitions. [2019-12-07 13:18:54,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:18:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20082 states and 61448 transitions. [2019-12-07 13:18:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:54,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:54,929 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] [2019-12-07 13:18:54,929 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1435143134, now seen corresponding path program 11 times [2019-12-07 13:18:54,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:54,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353135860] [2019-12-07 13:18:54,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:18:55,047 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 13:18:55,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353135860] [2019-12-07 13:18:55,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:18:55,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:18:55,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717213223] [2019-12-07 13:18:55,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:18:55,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:18:55,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:18:55,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:18:55,048 INFO L87 Difference]: Start difference. First operand 20082 states and 61448 transitions. Second operand 12 states. [2019-12-07 13:18:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:18:55,538 INFO L93 Difference]: Finished difference Result 28483 states and 86595 transitions. [2019-12-07 13:18:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:18:55,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-07 13:18:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:18:55,572 INFO L225 Difference]: With dead ends: 28483 [2019-12-07 13:18:55,572 INFO L226 Difference]: Without dead ends: 27388 [2019-12-07 13:18:55,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:18:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27388 states. [2019-12-07 13:18:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27388 to 19304. [2019-12-07 13:18:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19304 states. [2019-12-07 13:18:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19304 states to 19304 states and 59384 transitions. [2019-12-07 13:18:55,911 INFO L78 Accepts]: Start accepts. Automaton has 19304 states and 59384 transitions. Word has length 59 [2019-12-07 13:18:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:18:55,911 INFO L462 AbstractCegarLoop]: Abstraction has 19304 states and 59384 transitions. [2019-12-07 13:18:55,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:18:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19304 states and 59384 transitions. [2019-12-07 13:18:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:18:55,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:18:55,930 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] [2019-12-07 13:18:55,930 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:18:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:18:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 12 times [2019-12-07 13:18:55,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:18:55,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930485855] [2019-12-07 13:18:55,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:18:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:18:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:18:56,017 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:18:56,017 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:18:56,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:18:56,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-07 13:18:56,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-07 13:18:56,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953) (= |P2Thread1of1ForFork3_#in~arg.base_In1240341953| P2Thread1of1ForFork3_~arg.base_Out1240341953) (= 1 ~y$w_buff0_used~0_Out1240341953) (= (ite (not (and (not (= 0 (mod ~y$w_buff0_used~0_Out1240341953 256))) (not (= 0 (mod ~y$w_buff1_used~0_Out1240341953 256))))) 1 0) |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953|) (= P2Thread1of1ForFork3_~arg.offset_Out1240341953 |P2Thread1of1ForFork3_#in~arg.offset_In1240341953|) (= ~y$w_buff1_used~0_Out1240341953 ~y$w_buff0_used~0_In1240341953) (= ~y$w_buff0~0_In1240341953 ~y$w_buff1~0_Out1240341953) (= ~y$w_buff0~0_Out1240341953 1) (not (= 0 P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1240341953, ~y$w_buff0~0=~y$w_buff0~0_In1240341953, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1240341953|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1240341953|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1240341953, ~y$w_buff1~0=~y$w_buff1~0_Out1240341953, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953|, ~y$w_buff0~0=~y$w_buff0~0_Out1240341953, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out1240341953, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1240341953|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out1240341953, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1240341953|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1240341953} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:18:56,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-07 13:18:56,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~a~0_19 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:18:56,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-2119798901| |P3Thread1of1ForFork0_#t~ite32_Out-2119798901|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2119798901 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-2119798901 256) 0))) (or (and .cse0 (= ~y$w_buff1~0_In-2119798901 |P3Thread1of1ForFork0_#t~ite32_Out-2119798901|) (not .cse1) (not .cse2)) (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-2119798901| ~y~0_In-2119798901) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2119798901, ~y$w_buff1~0=~y$w_buff1~0_In-2119798901, ~y~0=~y~0_In-2119798901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119798901} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2119798901, ~y$w_buff1~0=~y$w_buff1~0_In-2119798901, ~y~0=~y~0_In-2119798901, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-2119798901|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-2119798901|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119798901} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 13:18:56,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-425214128 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-425214128 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-425214128| 0)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-425214128| ~y$w_buff0_used~0_In-425214128) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-425214128, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-425214128} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-425214128, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-425214128, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-425214128|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 13:18:56,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1547707947 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1547707947 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1547707947| ~y$w_buff0_used~0_In1547707947) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1547707947|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1547707947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547707947} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1547707947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547707947, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1547707947|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 13:18:56,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In712593786 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In712593786 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In712593786 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In712593786 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out712593786| ~y$w_buff1_used~0_In712593786)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out712593786| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In712593786, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712593786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712593786, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712593786} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In712593786, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712593786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712593786, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out712593786|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712593786} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 13:18:56,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1934197455 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1934197455| ~y$w_buff0~0_In-1934197455) (= |P1Thread1of1ForFork2_#t~ite9_Out-1934197455| |P1Thread1of1ForFork2_#t~ite8_Out-1934197455|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1934197455 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1934197455 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1934197455 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-1934197455 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite8_In-1934197455| |P1Thread1of1ForFork2_#t~ite8_Out-1934197455|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1934197455| ~y$w_buff0~0_In-1934197455) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934197455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934197455, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1934197455|, ~y$w_buff0~0=~y$w_buff0~0_In-1934197455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934197455, ~weak$$choice2~0=~weak$$choice2~0_In-1934197455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934197455} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934197455, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1934197455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934197455, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1934197455|, ~y$w_buff0~0=~y$w_buff0~0_In-1934197455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934197455, ~weak$$choice2~0=~weak$$choice2~0_In-1934197455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934197455} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 13:18:56,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1526529961 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1526529961 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out1526529961 ~y$r_buff0_thd3~0_In1526529961))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd3~0_Out1526529961 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1526529961, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1526529961} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1526529961|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1526529961, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1526529961} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:18:56,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1705438328 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1705438328 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1705438328 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1705438328 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-1705438328| ~y$r_buff1_thd3~0_In-1705438328) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-1705438328|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705438328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705438328, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705438328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705438328} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705438328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705438328, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705438328, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1705438328|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705438328} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 13:18:56,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_57) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 13:18:56,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1097469676 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1097469676 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1097469676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1097469676 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1097469676| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out-1097469676| ~y$w_buff1_used~0_In-1097469676) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1097469676, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1097469676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097469676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1097469676} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1097469676, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1097469676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097469676, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1097469676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1097469676} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 13:18:56,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In152241850 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In152241850 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In152241850 |P3Thread1of1ForFork0_#t~ite36_Out152241850|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out152241850|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In152241850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In152241850} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In152241850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In152241850, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out152241850|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 13:18:56,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1281849053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1281849053 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1281849053 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-1281849053 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1281849053| ~y$r_buff1_thd4~0_In-1281849053)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1281849053|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1281849053, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1281849053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281849053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281849053} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1281849053, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1281849053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281849053, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1281849053|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281849053} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 13:18:56,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_34| v_~y$r_buff1_thd4~0_55) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_33|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:18:56,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1875042691 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1875042691| ~y$w_buff1~0_In1875042691) (= |P1Thread1of1ForFork2_#t~ite11_In1875042691| |P1Thread1of1ForFork2_#t~ite11_Out1875042691|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1875042691| ~y$w_buff1~0_In1875042691) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1875042691 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1875042691 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1875042691 256) 0)) (= (mod ~y$w_buff0_used~0_In1875042691 256) 0))) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1875042691| |P1Thread1of1ForFork2_#t~ite12_Out1875042691|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875042691, ~y$w_buff1~0=~y$w_buff1~0_In1875042691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875042691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875042691, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1875042691|, ~weak$$choice2~0=~weak$$choice2~0_In1875042691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875042691} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875042691, ~y$w_buff1~0=~y$w_buff1~0_In1875042691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875042691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875042691, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1875042691|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1875042691|, ~weak$$choice2~0=~weak$$choice2~0_In1875042691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875042691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:18:56,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1183422851 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-1183422851| |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1183422851 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1183422851 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1183422851 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1183422851 256) 0))) (= ~y$w_buff0_used~0_In-1183422851 |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|)) (and (= ~y$w_buff0_used~0_In-1183422851 |P1Thread1of1ForFork2_#t~ite15_Out-1183422851|) (= |P1Thread1of1ForFork2_#t~ite14_In-1183422851| |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183422851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183422851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1183422851, ~weak$$choice2~0=~weak$$choice2~0_In-1183422851, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1183422851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183422851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183422851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183422851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1183422851, ~weak$$choice2~0=~weak$$choice2~0_In-1183422851, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1183422851|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1183422851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183422851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:18:56,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:18:56,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-905989814 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-905989814| |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (= ~y$r_buff1_thd2~0_In-905989814 |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-905989814 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-905989814 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-905989814 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-905989814 256)))))) (and (= |P1Thread1of1ForFork2_#t~ite24_Out-905989814| ~y$r_buff1_thd2~0_In-905989814) (= |P1Thread1of1ForFork2_#t~ite23_In-905989814| |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-905989814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-905989814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-905989814, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-905989814|, ~weak$$choice2~0=~weak$$choice2~0_In-905989814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905989814} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-905989814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-905989814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-905989814, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-905989814|, ~weak$$choice2~0=~weak$$choice2~0_In-905989814, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-905989814|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905989814} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 13:18:56,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:18:56,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_20) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:18:56,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-570813362 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-570813362 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-570813362 |ULTIMATE.start_main_#t~ite42_Out-570813362|) (not .cse1)) (and (= ~y~0_In-570813362 |ULTIMATE.start_main_#t~ite42_Out-570813362|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-570813362, ~y~0=~y~0_In-570813362, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570813362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570813362} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-570813362, ~y~0=~y~0_In-570813362, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-570813362|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570813362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570813362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:18:56,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:18:56,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1909965113 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1909965113 256)))) (or (and (= ~y$w_buff0_used~0_In-1909965113 |ULTIMATE.start_main_#t~ite44_Out-1909965113|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1909965113|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1909965113, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1909965113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1909965113, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1909965113, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1909965113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:18:56,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-367620375 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-367620375 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-367620375 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-367620375 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-367620375|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-367620375 |ULTIMATE.start_main_#t~ite45_Out-367620375|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-367620375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367620375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-367620375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-367620375} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-367620375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367620375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-367620375, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-367620375|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-367620375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:18:56,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In524802254 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In524802254 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out524802254| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In524802254 |ULTIMATE.start_main_#t~ite46_Out524802254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In524802254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524802254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In524802254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524802254, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out524802254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:18:56,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1277382263 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1277382263 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1277382263 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1277382263 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1277382263|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1277382263 |ULTIMATE.start_main_#t~ite47_Out-1277382263|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277382263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1277382263, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1277382263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277382263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277382263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1277382263, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1277382263|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1277382263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277382263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 13:18:56,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_29) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:18:56,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:18:56 BasicIcfg [2019-12-07 13:18:56,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:18:56,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:18:56,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:18:56,109 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:18:56,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:31" (3/4) ... [2019-12-07 13:18:56,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:18:56,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:18:56,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-07 13:18:56,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-07 13:18:56,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953) (= |P2Thread1of1ForFork3_#in~arg.base_In1240341953| P2Thread1of1ForFork3_~arg.base_Out1240341953) (= 1 ~y$w_buff0_used~0_Out1240341953) (= (ite (not (and (not (= 0 (mod ~y$w_buff0_used~0_Out1240341953 256))) (not (= 0 (mod ~y$w_buff1_used~0_Out1240341953 256))))) 1 0) |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953|) (= P2Thread1of1ForFork3_~arg.offset_Out1240341953 |P2Thread1of1ForFork3_#in~arg.offset_In1240341953|) (= ~y$w_buff1_used~0_Out1240341953 ~y$w_buff0_used~0_In1240341953) (= ~y$w_buff0~0_In1240341953 ~y$w_buff1~0_Out1240341953) (= ~y$w_buff0~0_Out1240341953 1) (not (= 0 P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1240341953, ~y$w_buff0~0=~y$w_buff0~0_In1240341953, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1240341953|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1240341953|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1240341953, ~y$w_buff1~0=~y$w_buff1~0_Out1240341953, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1240341953|, ~y$w_buff0~0=~y$w_buff0~0_Out1240341953, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out1240341953, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1240341953, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1240341953|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out1240341953, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1240341953|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1240341953} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:18:56,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-07 13:18:56,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~a~0_19 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:18:56,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-2119798901| |P3Thread1of1ForFork0_#t~ite32_Out-2119798901|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2119798901 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-2119798901 256) 0))) (or (and .cse0 (= ~y$w_buff1~0_In-2119798901 |P3Thread1of1ForFork0_#t~ite32_Out-2119798901|) (not .cse1) (not .cse2)) (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-2119798901| ~y~0_In-2119798901) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2119798901, ~y$w_buff1~0=~y$w_buff1~0_In-2119798901, ~y~0=~y~0_In-2119798901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119798901} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2119798901, ~y$w_buff1~0=~y$w_buff1~0_In-2119798901, ~y~0=~y~0_In-2119798901, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-2119798901|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-2119798901|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119798901} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 13:18:56,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-425214128 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-425214128 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-425214128| 0)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-425214128| ~y$w_buff0_used~0_In-425214128) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-425214128, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-425214128} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-425214128, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-425214128, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-425214128|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 13:18:56,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1547707947 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1547707947 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1547707947| ~y$w_buff0_used~0_In1547707947) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1547707947|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1547707947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547707947} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1547707947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1547707947, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1547707947|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 13:18:56,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In712593786 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In712593786 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In712593786 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In712593786 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out712593786| ~y$w_buff1_used~0_In712593786)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out712593786| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In712593786, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712593786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712593786, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712593786} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In712593786, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712593786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712593786, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out712593786|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712593786} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 13:18:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1934197455 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1934197455| ~y$w_buff0~0_In-1934197455) (= |P1Thread1of1ForFork2_#t~ite9_Out-1934197455| |P1Thread1of1ForFork2_#t~ite8_Out-1934197455|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1934197455 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1934197455 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1934197455 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-1934197455 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite8_In-1934197455| |P1Thread1of1ForFork2_#t~ite8_Out-1934197455|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1934197455| ~y$w_buff0~0_In-1934197455) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934197455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934197455, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1934197455|, ~y$w_buff0~0=~y$w_buff0~0_In-1934197455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934197455, ~weak$$choice2~0=~weak$$choice2~0_In-1934197455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934197455} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1934197455, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1934197455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934197455, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1934197455|, ~y$w_buff0~0=~y$w_buff0~0_In-1934197455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1934197455, ~weak$$choice2~0=~weak$$choice2~0_In-1934197455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1934197455} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 13:18:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1526529961 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1526529961 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out1526529961 ~y$r_buff0_thd3~0_In1526529961))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd3~0_Out1526529961 0) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1526529961, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1526529961} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1526529961|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1526529961, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1526529961} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:18:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1705438328 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1705438328 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1705438328 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1705438328 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-1705438328| ~y$r_buff1_thd3~0_In-1705438328) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-1705438328|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705438328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705438328, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705438328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705438328} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705438328, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705438328, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705438328, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1705438328|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705438328} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 13:18:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_57) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 13:18:56,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1097469676 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1097469676 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1097469676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1097469676 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1097469676| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out-1097469676| ~y$w_buff1_used~0_In-1097469676) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1097469676, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1097469676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097469676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1097469676} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1097469676, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1097469676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097469676, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1097469676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1097469676} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 13:18:56,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In152241850 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In152241850 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In152241850 |P3Thread1of1ForFork0_#t~ite36_Out152241850|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out152241850|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In152241850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In152241850} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In152241850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In152241850, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out152241850|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 13:18:56,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1281849053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1281849053 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1281849053 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-1281849053 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1281849053| ~y$r_buff1_thd4~0_In-1281849053)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1281849053|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1281849053, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1281849053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281849053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281849053} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1281849053, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1281849053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281849053, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1281849053|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281849053} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 13:18:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_34| v_~y$r_buff1_thd4~0_55) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_33|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:18:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1875042691 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1875042691| ~y$w_buff1~0_In1875042691) (= |P1Thread1of1ForFork2_#t~ite11_In1875042691| |P1Thread1of1ForFork2_#t~ite11_Out1875042691|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1875042691| ~y$w_buff1~0_In1875042691) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1875042691 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1875042691 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1875042691 256) 0)) (= (mod ~y$w_buff0_used~0_In1875042691 256) 0))) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1875042691| |P1Thread1of1ForFork2_#t~ite12_Out1875042691|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875042691, ~y$w_buff1~0=~y$w_buff1~0_In1875042691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875042691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875042691, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1875042691|, ~weak$$choice2~0=~weak$$choice2~0_In1875042691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875042691} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875042691, ~y$w_buff1~0=~y$w_buff1~0_In1875042691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875042691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875042691, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1875042691|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1875042691|, ~weak$$choice2~0=~weak$$choice2~0_In1875042691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875042691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:18:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1183422851 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-1183422851| |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1183422851 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1183422851 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1183422851 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1183422851 256) 0))) (= ~y$w_buff0_used~0_In-1183422851 |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|)) (and (= ~y$w_buff0_used~0_In-1183422851 |P1Thread1of1ForFork2_#t~ite15_Out-1183422851|) (= |P1Thread1of1ForFork2_#t~ite14_In-1183422851| |P1Thread1of1ForFork2_#t~ite14_Out-1183422851|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183422851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183422851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1183422851, ~weak$$choice2~0=~weak$$choice2~0_In-1183422851, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1183422851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183422851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183422851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1183422851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1183422851, ~weak$$choice2~0=~weak$$choice2~0_In-1183422851, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1183422851|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1183422851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183422851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 13:18:56,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:18:56,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-905989814 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-905989814| |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (= ~y$r_buff1_thd2~0_In-905989814 |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-905989814 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-905989814 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-905989814 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-905989814 256)))))) (and (= |P1Thread1of1ForFork2_#t~ite24_Out-905989814| ~y$r_buff1_thd2~0_In-905989814) (= |P1Thread1of1ForFork2_#t~ite23_In-905989814| |P1Thread1of1ForFork2_#t~ite23_Out-905989814|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-905989814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-905989814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-905989814, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-905989814|, ~weak$$choice2~0=~weak$$choice2~0_In-905989814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905989814} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-905989814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-905989814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-905989814, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-905989814|, ~weak$$choice2~0=~weak$$choice2~0_In-905989814, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-905989814|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905989814} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 13:18:56,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:18:56,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_20) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:18:56,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-570813362 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-570813362 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-570813362 |ULTIMATE.start_main_#t~ite42_Out-570813362|) (not .cse1)) (and (= ~y~0_In-570813362 |ULTIMATE.start_main_#t~ite42_Out-570813362|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-570813362, ~y~0=~y~0_In-570813362, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570813362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570813362} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-570813362, ~y~0=~y~0_In-570813362, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-570813362|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570813362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570813362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:18:56,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:18:56,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1909965113 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1909965113 256)))) (or (and (= ~y$w_buff0_used~0_In-1909965113 |ULTIMATE.start_main_#t~ite44_Out-1909965113|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1909965113|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1909965113, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1909965113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1909965113, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1909965113, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1909965113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:18:56,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-367620375 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-367620375 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-367620375 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-367620375 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-367620375|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-367620375 |ULTIMATE.start_main_#t~ite45_Out-367620375|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-367620375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367620375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-367620375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-367620375} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-367620375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367620375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-367620375, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-367620375|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-367620375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:18:56,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In524802254 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In524802254 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out524802254| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In524802254 |ULTIMATE.start_main_#t~ite46_Out524802254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In524802254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524802254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In524802254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524802254, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out524802254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:18:56,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1277382263 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1277382263 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1277382263 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1277382263 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1277382263|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1277382263 |ULTIMATE.start_main_#t~ite47_Out-1277382263|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277382263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1277382263, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1277382263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277382263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277382263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1277382263, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1277382263|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1277382263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277382263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 13:18:56,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_29) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:18:56,201 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fdf34b61-bb48-4a6d-8dbb-63e9e93850b5/bin/utaipan/witness.graphml [2019-12-07 13:18:56,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:18:56,202 INFO L168 Benchmark]: Toolchain (without parser) took 205230.17 ms. Allocated memory was 1.0 GB in the beginning and 9.2 GB in the end (delta: 8.2 GB). Free memory was 939.7 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. [2019-12-07 13:18:56,203 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:18:56,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:18:56,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 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 13:18:56,203 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 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 13:18:56,203 INFO L168 Benchmark]: RCFGBuilder took 392.62 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:18:56,204 INFO L168 Benchmark]: TraceAbstraction took 204228.13 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 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 5.6 GB. Max. memory is 11.5 GB. [2019-12-07 13:18:56,204 INFO L168 Benchmark]: Witness Printer took 92.67 ms. Allocated memory is still 9.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:18:56,205 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.85 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 24.93 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 392.62 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 204228.13 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 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 5.6 GB. Max. memory is 11.5 GB. * Witness Printer took 92.67 ms. Allocated memory is still 9.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 204.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 51.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5297 SDtfs, 7988 SDslu, 19287 SDs, 0 SdLazy, 13901 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272736occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 118.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 342195 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1146 NumberOfCodeBlocks, 1146 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 368443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...