./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4033a21503ef5f16f718d5502cb57c5c6653980b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:09:03,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:09:03,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:09:03,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:09:03,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:09:03,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:09:03,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:09:03,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:09:03,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:09:03,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:09:03,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:09:03,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:09:03,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:09:03,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:09:03,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:09:03,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:09:03,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:09:03,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:09:03,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:09:03,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:09:03,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:09:03,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:09:03,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:09:03,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:09:03,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:09:03,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:09:03,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:09:03,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:09:03,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:09:03,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:09:03,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:09:03,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:09:03,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:09:03,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:09:03,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:09:03,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:09:03,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:09:03,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:09:03,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:09:03,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:09:03,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:09:03,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:09:03,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:09:03,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:09:03,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:09:03,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:09:03,566 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:09:03,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:09:03,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:09:03,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:09:03,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:09:03,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:09:03,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer 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 -> Automizer 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 -> 4033a21503ef5f16f718d5502cb57c5c6653980b [2019-12-07 18:09:03,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:09:03,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:09:03,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:09:03,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:09:03,678 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:09:03,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-12-07 18:09:03,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/data/c1a5c4804/a250733a731e49e2a01e3e0985380de2/FLAG605706859 [2019-12-07 18:09:04,148 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:09:04,148 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-12-07 18:09:04,158 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/data/c1a5c4804/a250733a731e49e2a01e3e0985380de2/FLAG605706859 [2019-12-07 18:09:04,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/data/c1a5c4804/a250733a731e49e2a01e3e0985380de2 [2019-12-07 18:09:04,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:09:04,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:09:04,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:04,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:09:04,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:09:04,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04, skipping insertion in model container [2019-12-07 18:09:04,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:09:04,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:09:04,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:04,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:09:04,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:09:04,905 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:09:04,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04 WrapperNode [2019-12-07 18:09:04,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:09:04,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:09:04,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:09:04,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:09:04,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:09:04,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:09:04,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:09:04,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:09:04,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... [2019-12-07 18:09:04,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:09:04,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:09:04,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:09:04,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:09:04,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/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 18:09:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:09:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:09:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:09:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:09:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:09:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:09:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:09:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:09:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:09:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:09:05,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:09:05,015 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:09:05,354 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:09:05,354 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:09:05,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:05 BoogieIcfgContainer [2019-12-07 18:09:05,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:09:05,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:09:05,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:09:05,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:09:05,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:09:04" (1/3) ... [2019-12-07 18:09:05,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d85119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:05, skipping insertion in model container [2019-12-07 18:09:05,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:09:04" (2/3) ... [2019-12-07 18:09:05,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d85119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:09:05, skipping insertion in model container [2019-12-07 18:09:05,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:05" (3/3) ... [2019-12-07 18:09:05,360 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-12-07 18:09:05,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:09:05,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:09:05,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:09:05,372 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:09:05,431 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:09:05,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:09:05,444 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:09:05,444 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:09:05,444 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:09:05,444 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:09:05,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:09:05,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:09:05,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:09:05,456 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-07 18:09:05,457 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 18:09:05,511 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 18:09:05,511 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:09:05,518 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:09:05,529 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 18:09:05,555 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 18:09:05,555 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:09:05,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:09:05,569 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:09:05,570 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:09:08,241 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 18:09:08,534 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-07 18:09:08,534 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 18:09:08,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 18:09:08,942 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-07 18:09:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-07 18:09:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:09:08,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:08,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:09:08,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-07 18:09:08,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:08,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387799442] [2019-12-07 18:09:08,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:09,114 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 18:09:09,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387799442] [2019-12-07 18:09:09,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:09,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:09:09,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888525683] [2019-12-07 18:09:09,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:09,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:09,130 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-07 18:09:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:09,323 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-07 18:09:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:09,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:09:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:09,389 INFO L225 Difference]: With dead ends: 8460 [2019-12-07 18:09:09,389 INFO L226 Difference]: Without dead ends: 7472 [2019-12-07 18:09:09,390 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 18:09:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-07 18:09:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-07 18:09:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-07 18:09:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-07 18:09:09,647 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-07 18:09:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-07 18:09:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-07 18:09:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:09:09,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:09,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:09,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-07 18:09:09,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:09,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81957662] [2019-12-07 18:09:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:09,715 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 18:09:09,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81957662] [2019-12-07 18:09:09,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:09,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033173482] [2019-12-07 18:09:09,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:09,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:09,718 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-07 18:09:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:09,962 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-07 18:09:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:09:09,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:09:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:10,018 INFO L225 Difference]: With dead ends: 11704 [2019-12-07 18:09:10,019 INFO L226 Difference]: Without dead ends: 11690 [2019-12-07 18:09:10,019 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 18:09:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-07 18:09:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-07 18:09:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-07 18:09:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-07 18:09:10,241 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-07 18:09:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:10,241 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-07 18:09:10,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-07 18:09:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:09:10,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:10,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:10,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-07 18:09:10,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:10,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462367892] [2019-12-07 18:09:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:10,321 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 18:09:10,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462367892] [2019-12-07 18:09:10,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:10,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:10,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157579769] [2019-12-07 18:09:10,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:10,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:10,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:10,323 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-07 18:09:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:10,566 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-07 18:09:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:09:10,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 18:09:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:10,595 INFO L225 Difference]: With dead ends: 15000 [2019-12-07 18:09:10,595 INFO L226 Difference]: Without dead ends: 15000 [2019-12-07 18:09:10,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-07 18:09:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-07 18:09:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-07 18:09:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-07 18:09:10,883 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-07 18:09:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:10,884 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-07 18:09:10,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-07 18:09:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:09:10,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:10,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:10,887 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-07 18:09:10,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:10,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962057800] [2019-12-07 18:09:10,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:10,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962057800] [2019-12-07 18:09:10,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:10,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:10,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146984549] [2019-12-07 18:09:10,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:10,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:10,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:10,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:10,942 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-07 18:09:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:10,977 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-12-07 18:09:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:10,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:09:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:10,998 INFO L225 Difference]: With dead ends: 11886 [2019-12-07 18:09:10,999 INFO L226 Difference]: Without dead ends: 11886 [2019-12-07 18:09:10,999 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 18:09:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-12-07 18:09:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-12-07 18:09:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-12-07 18:09:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-12-07 18:09:11,171 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-12-07 18:09:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,171 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-12-07 18:09:11,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-12-07 18:09:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:09:11,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:11,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-12-07 18:09:11,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284091578] [2019-12-07 18:09:11,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,216 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 18:09:11,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284091578] [2019-12-07 18:09:11,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:11,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992790146] [2019-12-07 18:09:11,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:09:11,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:09:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:09:11,218 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 4 states. [2019-12-07 18:09:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,241 INFO L93 Difference]: Finished difference Result 2202 states and 5524 transitions. [2019-12-07 18:09:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:09:11,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:09:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,243 INFO L225 Difference]: With dead ends: 2202 [2019-12-07 18:09:11,243 INFO L226 Difference]: Without dead ends: 1544 [2019-12-07 18:09:11,244 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 18:09:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-07 18:09:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2019-12-07 18:09:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-12-07 18:09:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 3419 transitions. [2019-12-07 18:09:11,259 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 3419 transitions. Word has length 16 [2019-12-07 18:09:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,259 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 3419 transitions. [2019-12-07 18:09:11,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:09:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 3419 transitions. [2019-12-07 18:09:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:09:11,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:11,261 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-07 18:09:11,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54693351] [2019-12-07 18:09:11,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,312 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 18:09:11,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54693351] [2019-12-07 18:09:11,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:11,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25469995] [2019-12-07 18:09:11,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:09:11,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:09:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:09:11,314 INFO L87 Difference]: Start difference. First operand 1544 states and 3419 transitions. Second operand 6 states. [2019-12-07 18:09:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,532 INFO L93 Difference]: Finished difference Result 2374 states and 5046 transitions. [2019-12-07 18:09:11,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:09:11,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:09:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,534 INFO L225 Difference]: With dead ends: 2374 [2019-12-07 18:09:11,534 INFO L226 Difference]: Without dead ends: 2323 [2019-12-07 18:09:11,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-07 18:09:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1516. [2019-12-07 18:09:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-12-07 18:09:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3357 transitions. [2019-12-07 18:09:11,558 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3357 transitions. Word has length 25 [2019-12-07 18:09:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,558 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3357 transitions. [2019-12-07 18:09:11,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:09:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3357 transitions. [2019-12-07 18:09:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:09:11,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:11,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2030434196, now seen corresponding path program 1 times [2019-12-07 18:09:11,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803192462] [2019-12-07 18:09:11,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,609 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 18:09:11,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803192462] [2019-12-07 18:09:11,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:11,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431888859] [2019-12-07 18:09:11,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:11,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:11,610 INFO L87 Difference]: Start difference. First operand 1516 states and 3357 transitions. Second operand 3 states. [2019-12-07 18:09:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,623 INFO L93 Difference]: Finished difference Result 2521 states and 5599 transitions. [2019-12-07 18:09:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:11,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:09:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,625 INFO L225 Difference]: With dead ends: 2521 [2019-12-07 18:09:11,625 INFO L226 Difference]: Without dead ends: 2046 [2019-12-07 18:09:11,625 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 18:09:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-12-07 18:09:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2017. [2019-12-07 18:09:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-12-07 18:09:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4535 transitions. [2019-12-07 18:09:11,644 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4535 transitions. Word has length 27 [2019-12-07 18:09:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,644 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 4535 transitions. [2019-12-07 18:09:11,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4535 transitions. [2019-12-07 18:09:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:09:11,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:09:11,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-07 18:09:11,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543422644] [2019-12-07 18:09:11,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,703 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 18:09:11,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543422644] [2019-12-07 18:09:11,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:09:11,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081247676] [2019-12-07 18:09:11,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:09:11,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:09:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:09:11,704 INFO L87 Difference]: Start difference. First operand 2017 states and 4535 transitions. Second operand 5 states. [2019-12-07 18:09:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,735 INFO L93 Difference]: Finished difference Result 1101 states and 2460 transitions. [2019-12-07 18:09:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:09:11,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:09:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,737 INFO L225 Difference]: With dead ends: 1101 [2019-12-07 18:09:11,737 INFO L226 Difference]: Without dead ends: 983 [2019-12-07 18:09:11,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-12-07 18:09:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 707. [2019-12-07 18:09:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-07 18:09:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1554 transitions. [2019-12-07 18:09:11,748 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1554 transitions. Word has length 28 [2019-12-07 18:09:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,748 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1554 transitions. [2019-12-07 18:09:11,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:09:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1554 transitions. [2019-12-07 18:09:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:09:11,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,751 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] [2019-12-07 18:09:11,751 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-07 18:09:11,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787656113] [2019-12-07 18:09:11,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,787 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 18:09:11,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787656113] [2019-12-07 18:09:11,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:09:11,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472085112] [2019-12-07 18:09:11,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:11,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:11,789 INFO L87 Difference]: Start difference. First operand 707 states and 1554 transitions. Second operand 3 states. [2019-12-07 18:09:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,817 INFO L93 Difference]: Finished difference Result 1066 states and 2274 transitions. [2019-12-07 18:09:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:11,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:09:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,818 INFO L225 Difference]: With dead ends: 1066 [2019-12-07 18:09:11,819 INFO L226 Difference]: Without dead ends: 1066 [2019-12-07 18:09:11,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-07 18:09:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 806. [2019-12-07 18:09:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-12-07 18:09:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1751 transitions. [2019-12-07 18:09:11,866 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1751 transitions. Word has length 52 [2019-12-07 18:09:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,867 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1751 transitions. [2019-12-07 18:09:11,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1751 transitions. [2019-12-07 18:09:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:09:11,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,869 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] [2019-12-07 18:09:11,869 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-07 18:09:11,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169700947] [2019-12-07 18:09:11,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:11,917 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 18:09:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169700947] [2019-12-07 18:09:11,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:11,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:09:11,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345819474] [2019-12-07 18:09:11,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:09:11,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:09:11,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:09:11,918 INFO L87 Difference]: Start difference. First operand 806 states and 1751 transitions. Second operand 3 states. [2019-12-07 18:09:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:11,954 INFO L93 Difference]: Finished difference Result 1015 states and 2185 transitions. [2019-12-07 18:09:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:09:11,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:09:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:11,956 INFO L225 Difference]: With dead ends: 1015 [2019-12-07 18:09:11,956 INFO L226 Difference]: Without dead ends: 1015 [2019-12-07 18:09:11,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:09:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-07 18:09:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 782. [2019-12-07 18:09:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-07 18:09:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1716 transitions. [2019-12-07 18:09:11,964 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1716 transitions. Word has length 52 [2019-12-07 18:09:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:11,964 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1716 transitions. [2019-12-07 18:09:11,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:09:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1716 transitions. [2019-12-07 18:09:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:11,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:09:11,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash -802094331, now seen corresponding path program 1 times [2019-12-07 18:09:11,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:11,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348257325] [2019-12-07 18:09:11,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:12,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348257325] [2019-12-07 18:09:12,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:12,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:09:12,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719024689] [2019-12-07 18:09:12,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:09:12,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:09:12,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:09:12,169 INFO L87 Difference]: Start difference. First operand 782 states and 1716 transitions. Second operand 12 states. [2019-12-07 18:09:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:13,871 INFO L93 Difference]: Finished difference Result 3596 states and 7564 transitions. [2019-12-07 18:09:13,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:09:13,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 18:09:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:13,873 INFO L225 Difference]: With dead ends: 3596 [2019-12-07 18:09:13,873 INFO L226 Difference]: Without dead ends: 2036 [2019-12-07 18:09:13,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:09:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-07 18:09:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 864. [2019-12-07 18:09:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-12-07 18:09:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1901 transitions. [2019-12-07 18:09:13,886 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1901 transitions. Word has length 53 [2019-12-07 18:09:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:13,886 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1901 transitions. [2019-12-07 18:09:13,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:09:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1901 transitions. [2019-12-07 18:09:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:13,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:13,887 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] [2019-12-07 18:09:13,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2018843623, now seen corresponding path program 2 times [2019-12-07 18:09:13,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:13,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047448047] [2019-12-07 18:09:13,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:09:14,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047448047] [2019-12-07 18:09:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 18:09:14,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528446432] [2019-12-07 18:09:14,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:09:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:09:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:09:14,428 INFO L87 Difference]: Start difference. First operand 864 states and 1901 transitions. Second operand 18 states. [2019-12-07 18:09:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:17,571 INFO L93 Difference]: Finished difference Result 2473 states and 5203 transitions. [2019-12-07 18:09:17,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 18:09:17,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-12-07 18:09:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:17,573 INFO L225 Difference]: With dead ends: 2473 [2019-12-07 18:09:17,573 INFO L226 Difference]: Without dead ends: 2181 [2019-12-07 18:09:17,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=1908, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:09:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-12-07 18:09:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1121. [2019-12-07 18:09:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-12-07 18:09:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 2400 transitions. [2019-12-07 18:09:17,585 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 2400 transitions. Word has length 53 [2019-12-07 18:09:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:17,586 INFO L462 AbstractCegarLoop]: Abstraction has 1121 states and 2400 transitions. [2019-12-07 18:09:17,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:09:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2400 transitions. [2019-12-07 18:09:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:17,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:17,587 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] [2019-12-07 18:09:17,587 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1009016267, now seen corresponding path program 3 times [2019-12-07 18:09:17,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:17,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629478368] [2019-12-07 18:09:17,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:17,734 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 18:09:17,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629478368] [2019-12-07 18:09:17,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:17,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:09:17,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009415596] [2019-12-07 18:09:17,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:09:17,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:09:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:09:17,736 INFO L87 Difference]: Start difference. First operand 1121 states and 2400 transitions. Second operand 10 states. [2019-12-07 18:09:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:19,133 INFO L93 Difference]: Finished difference Result 2587 states and 5608 transitions. [2019-12-07 18:09:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:09:19,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-07 18:09:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:19,135 INFO L225 Difference]: With dead ends: 2587 [2019-12-07 18:09:19,135 INFO L226 Difference]: Without dead ends: 2170 [2019-12-07 18:09:19,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:09:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-12-07 18:09:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1190. [2019-12-07 18:09:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-12-07 18:09:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 2554 transitions. [2019-12-07 18:09:19,148 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 2554 transitions. Word has length 53 [2019-12-07 18:09:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:19,148 INFO L462 AbstractCegarLoop]: Abstraction has 1190 states and 2554 transitions. [2019-12-07 18:09:19,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:09:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 2554 transitions. [2019-12-07 18:09:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:19,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:19,150 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] [2019-12-07 18:09:19,150 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1892814197, now seen corresponding path program 1 times [2019-12-07 18:09:19,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:19,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321874896] [2019-12-07 18:09:19,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:19,215 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 18:09:19,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321874896] [2019-12-07 18:09:19,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:19,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:09:19,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219312059] [2019-12-07 18:09:19,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:19,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:19,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:19,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:19,216 INFO L87 Difference]: Start difference. First operand 1190 states and 2554 transitions. Second operand 7 states. [2019-12-07 18:09:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:19,653 INFO L93 Difference]: Finished difference Result 1970 states and 4088 transitions. [2019-12-07 18:09:19,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:09:19,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:09:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:19,655 INFO L225 Difference]: With dead ends: 1970 [2019-12-07 18:09:19,655 INFO L226 Difference]: Without dead ends: 1970 [2019-12-07 18:09:19,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:09:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-07 18:09:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1145. [2019-12-07 18:09:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-07 18:09:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2479 transitions. [2019-12-07 18:09:19,667 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2479 transitions. Word has length 53 [2019-12-07 18:09:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:19,668 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2479 transitions. [2019-12-07 18:09:19,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2479 transitions. [2019-12-07 18:09:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:19,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:19,669 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] [2019-12-07 18:09:19,669 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -908091791, now seen corresponding path program 4 times [2019-12-07 18:09:19,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:19,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398762998] [2019-12-07 18:09:19,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:09:19,738 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 18:09:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398762998] [2019-12-07 18:09:19,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:09:19,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:09:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939210377] [2019-12-07 18:09:19,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:09:19,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:09:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:09:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:09:19,739 INFO L87 Difference]: Start difference. First operand 1145 states and 2479 transitions. Second operand 7 states. [2019-12-07 18:09:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:09:19,969 INFO L93 Difference]: Finished difference Result 3552 states and 7499 transitions. [2019-12-07 18:09:19,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:09:19,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:09:19,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:09:19,971 INFO L225 Difference]: With dead ends: 3552 [2019-12-07 18:09:19,971 INFO L226 Difference]: Without dead ends: 2375 [2019-12-07 18:09:19,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:09:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2019-12-07 18:09:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1012. [2019-12-07 18:09:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-12-07 18:09:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2179 transitions. [2019-12-07 18:09:19,985 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 2179 transitions. Word has length 53 [2019-12-07 18:09:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:09:19,985 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 2179 transitions. [2019-12-07 18:09:19,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:09:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 2179 transitions. [2019-12-07 18:09:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:09:19,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:09:19,987 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] [2019-12-07 18:09:19,987 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:09:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:09:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 5 times [2019-12-07 18:09:19,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:09:19,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572433214] [2019-12-07 18:09:19,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:09:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:09:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:09:20,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:09:20,051 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:09:20,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1449~0.base_35|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35| 1)) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_27|) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1449~0.base_35| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35|)) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35|) |v_ULTIMATE.start_main_~#t1449~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:09:20,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_In1527813265 ~y$r_buff1_thd1~0_Out1527813265) (= ~y$r_buff0_thd2~0_In1527813265 ~y$r_buff1_thd2~0_Out1527813265) (= ~y$r_buff1_thd0~0_Out1527813265 ~y$r_buff0_thd0~0_In1527813265) (= 1 ~y$r_buff0_thd1~0_Out1527813265) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265)) (= 1 ~x~0_Out1527813265)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527813265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1527813265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1527813265, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1527813265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1527813265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265, ~x~0=~x~0_Out1527813265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1527813265} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:09:20,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-12-07 18:09:20,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In729116322 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In729116322 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out729116322| ~y$w_buff0_used~0_In729116322)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out729116322|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In729116322} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out729116322|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In729116322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:09:20,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1915285819 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1915285819| |P1Thread1of1ForFork1_#t~ite15_Out1915285819|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1915285819 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1915285819 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1915285819 256))) (= (mod ~y$w_buff0_used~0_In1915285819 256) 0))) (= |P1Thread1of1ForFork1_#t~ite14_Out1915285819| ~y$w_buff0~0_In1915285819)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1915285819| ~y$w_buff0~0_In1915285819) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1915285819| |P1Thread1of1ForFork1_#t~ite14_Out1915285819|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1915285819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915285819, ~y$w_buff0~0=~y$w_buff0~0_In1915285819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1915285819, ~weak$$choice2~0=~weak$$choice2~0_In1915285819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1915285819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1915285819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915285819, ~y$w_buff0~0=~y$w_buff0~0_In1915285819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1915285819, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1915285819|, ~weak$$choice2~0=~weak$$choice2~0_In1915285819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1915285819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:09:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2112925162 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2112925162 |P1Thread1of1ForFork1_#t~ite21_Out-2112925162|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2112925162| |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|)) (and (= ~y$w_buff0_used~0_In-2112925162 |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2112925162 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-2112925162 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2112925162 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2112925162| |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2112925162|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, ~weak$$choice2~0=~weak$$choice2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2112925162|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2112925162|, ~weak$$choice2~0=~weak$$choice2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:09:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:09:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2099069821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-2099069821| |P1Thread1of1ForFork1_#t~ite29_Out-2099069821|) (= |P1Thread1of1ForFork1_#t~ite30_Out-2099069821| ~y$r_buff1_thd2~0_In-2099069821) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2099069821 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-2099069821 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2099069821 256))) (= (mod ~y$w_buff0_used~0_In-2099069821 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out-2099069821| |P1Thread1of1ForFork1_#t~ite29_Out-2099069821|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2099069821| ~y$r_buff1_thd2~0_In-2099069821) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2099069821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2099069821|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2099069821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:09:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (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} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:09:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1377282913| |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1377282913 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1377282913 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In1377282913 |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)) (and .cse0 (or .cse2 .cse1) (= ~y~0_In1377282913 |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1377282913, ~y$w_buff1~0=~y$w_buff1~0_In1377282913, ~y~0=~y~0_In1377282913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1377282913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1377282913, ~y$w_buff1~0=~y$w_buff1~0_In1377282913, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1377282913|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1377282913|, ~y~0=~y~0_In1377282913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1377282913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:09:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In300737084 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In300737084 256)))) (or (and (= ~y$w_buff0_used~0_In300737084 |P1Thread1of1ForFork1_#t~ite34_Out300737084|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out300737084|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out300737084|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:09:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1068015932 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1068015932 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1068015932 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1068015932 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1068015932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1068015932| ~y$w_buff1_used~0_In-1068015932)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068015932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068015932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068015932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068015932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068015932, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1068015932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068015932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:09:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1128259327 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1128259327 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1128259327| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1128259327| ~y$r_buff0_thd2~0_In1128259327)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1128259327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1128259327} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1128259327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1128259327, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1128259327|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1744369534 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1744369534 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1744369534 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1744369534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1744369534| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1744369534| ~y$r_buff1_thd2~0_In1744369534)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1744369534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1744369534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1744369534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1744369534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1744369534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1744369534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1744369534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1744369534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1744369534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In110272957 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In110272957 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In110272957 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In110272957 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out110272957|)) (and (= ~y$w_buff1_used~0_In110272957 |P0Thread1of1ForFork0_#t~ite6_Out110272957|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In110272957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110272957} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out110272957|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In110272957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110272957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In899375188 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out899375188 ~y$r_buff0_thd1~0_In899375188)) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out899375188 0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out899375188|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out899375188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1074244932 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1074244932 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1074244932 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1074244932 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1074244932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1074244932| ~y$r_buff1_thd1~0_In1074244932)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1074244932|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:09:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:09:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:09:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-99152115 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-99152115| |ULTIMATE.start_main_#t~ite40_Out-99152115|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y~0_In-99152115) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y$w_buff1~0_In-99152115) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-99152115|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-99152115|, ~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:09:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294244269 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-294244269 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-294244269 |ULTIMATE.start_main_#t~ite42_Out-294244269|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-294244269|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-294244269|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:09:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In408465644 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In408465644 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In408465644 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In408465644 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In408465644 |ULTIMATE.start_main_#t~ite43_Out408465644|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out408465644| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408465644, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408465644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408465644, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out408465644|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408465644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:09:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1531277962 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1531277962 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1531277962| ~y$r_buff0_thd0~0_In-1531277962) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1531277962| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1531277962|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:09:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1532077675 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1532077675 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1532077675 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1532077675 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1532077675| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1532077675| ~y$r_buff1_thd0~0_In1532077675) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532077675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1532077675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532077675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1532077675, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1532077675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:09:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:09:20,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:09:20 BasicIcfg [2019-12-07 18:09:20,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:09:20,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:09:20,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:09:20,114 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:09:20,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:09:05" (3/4) ... [2019-12-07 18:09:20,117 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:09:20,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1449~0.base_35|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35| 1)) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_27|) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1449~0.base_35| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35|)) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35|) |v_ULTIMATE.start_main_~#t1449~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:09:20,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_In1527813265 ~y$r_buff1_thd1~0_Out1527813265) (= ~y$r_buff0_thd2~0_In1527813265 ~y$r_buff1_thd2~0_Out1527813265) (= ~y$r_buff1_thd0~0_Out1527813265 ~y$r_buff0_thd0~0_In1527813265) (= 1 ~y$r_buff0_thd1~0_Out1527813265) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265)) (= 1 ~x~0_Out1527813265)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527813265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1527813265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1527813265, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1527813265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1527813265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1527813265, ~x~0=~x~0_Out1527813265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1527813265} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:09:20,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-12-07 18:09:20,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In729116322 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In729116322 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out729116322| ~y$w_buff0_used~0_In729116322)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out729116322|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In729116322} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out729116322|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In729116322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:09:20,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1915285819 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1915285819| |P1Thread1of1ForFork1_#t~ite15_Out1915285819|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1915285819 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1915285819 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1915285819 256))) (= (mod ~y$w_buff0_used~0_In1915285819 256) 0))) (= |P1Thread1of1ForFork1_#t~ite14_Out1915285819| ~y$w_buff0~0_In1915285819)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1915285819| ~y$w_buff0~0_In1915285819) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1915285819| |P1Thread1of1ForFork1_#t~ite14_Out1915285819|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1915285819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915285819, ~y$w_buff0~0=~y$w_buff0~0_In1915285819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1915285819, ~weak$$choice2~0=~weak$$choice2~0_In1915285819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1915285819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1915285819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915285819, ~y$w_buff0~0=~y$w_buff0~0_In1915285819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1915285819, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1915285819|, ~weak$$choice2~0=~weak$$choice2~0_In1915285819, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1915285819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:09:20,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2112925162 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2112925162 |P1Thread1of1ForFork1_#t~ite21_Out-2112925162|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2112925162| |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|)) (and (= ~y$w_buff0_used~0_In-2112925162 |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2112925162 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-2112925162 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2112925162 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2112925162| |P1Thread1of1ForFork1_#t~ite20_Out-2112925162|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2112925162|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, ~weak$$choice2~0=~weak$$choice2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2112925162|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2112925162|, ~weak$$choice2~0=~weak$$choice2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:09:20,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:09:20,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2099069821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-2099069821| |P1Thread1of1ForFork1_#t~ite29_Out-2099069821|) (= |P1Thread1of1ForFork1_#t~ite30_Out-2099069821| ~y$r_buff1_thd2~0_In-2099069821) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2099069821 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-2099069821 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2099069821 256))) (= (mod ~y$w_buff0_used~0_In-2099069821 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out-2099069821| |P1Thread1of1ForFork1_#t~ite29_Out-2099069821|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2099069821| ~y$r_buff1_thd2~0_In-2099069821) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2099069821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2099069821|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2099069821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:09:20,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (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} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:09:20,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1377282913| |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1377282913 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1377282913 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In1377282913 |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)) (and .cse0 (or .cse2 .cse1) (= ~y~0_In1377282913 |P1Thread1of1ForFork1_#t~ite32_Out1377282913|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1377282913, ~y$w_buff1~0=~y$w_buff1~0_In1377282913, ~y~0=~y~0_In1377282913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1377282913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1377282913, ~y$w_buff1~0=~y$w_buff1~0_In1377282913, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1377282913|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1377282913|, ~y~0=~y~0_In1377282913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1377282913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:09:20,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In300737084 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In300737084 256)))) (or (and (= ~y$w_buff0_used~0_In300737084 |P1Thread1of1ForFork1_#t~ite34_Out300737084|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out300737084|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out300737084|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:09:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1068015932 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1068015932 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1068015932 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1068015932 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1068015932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1068015932| ~y$w_buff1_used~0_In-1068015932)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068015932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068015932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068015932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068015932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068015932, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1068015932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068015932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:09:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1128259327 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1128259327 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1128259327| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1128259327| ~y$r_buff0_thd2~0_In1128259327)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1128259327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1128259327} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1128259327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1128259327, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1128259327|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:09:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1744369534 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1744369534 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1744369534 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1744369534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1744369534| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1744369534| ~y$r_buff1_thd2~0_In1744369534)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1744369534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1744369534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1744369534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1744369534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1744369534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1744369534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1744369534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1744369534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1744369534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:09:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In110272957 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In110272957 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In110272957 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In110272957 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out110272957|)) (and (= ~y$w_buff1_used~0_In110272957 |P0Thread1of1ForFork0_#t~ite6_Out110272957|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In110272957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110272957} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out110272957|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In110272957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110272957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:09:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In899375188 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out899375188 ~y$r_buff0_thd1~0_In899375188)) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out899375188 0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out899375188|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out899375188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:09:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1074244932 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1074244932 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1074244932 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1074244932 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1074244932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1074244932| ~y$r_buff1_thd1~0_In1074244932)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1074244932|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:09:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:09:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:09:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-99152115 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-99152115| |ULTIMATE.start_main_#t~ite40_Out-99152115|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y~0_In-99152115) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y$w_buff1~0_In-99152115) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-99152115|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-99152115|, ~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:09:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294244269 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-294244269 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-294244269 |ULTIMATE.start_main_#t~ite42_Out-294244269|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-294244269|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-294244269|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:09:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In408465644 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In408465644 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In408465644 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In408465644 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In408465644 |ULTIMATE.start_main_#t~ite43_Out408465644|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out408465644| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408465644, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408465644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408465644, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out408465644|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In408465644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:09:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1531277962 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1531277962 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1531277962| ~y$r_buff0_thd0~0_In-1531277962) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1531277962| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1531277962|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:09:20,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1532077675 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1532077675 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1532077675 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1532077675 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1532077675| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1532077675| ~y$r_buff1_thd0~0_In1532077675) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532077675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1532077675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1532077675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1532077675, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1532077675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:09:20,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:09:20,185 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b47bc54c-afff-4ecd-a51a-fc104feff2f0/bin/uautomizer/witness.graphml [2019-12-07 18:09:20,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:09:20,187 INFO L168 Benchmark]: Toolchain (without parser) took 15676.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 596.6 MB). Free memory was 940.8 MB in the beginning and 905.3 MB in the end (delta: 35.5 MB). Peak memory consumption was 632.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:20,187 INFO L168 Benchmark]: CDTParser took 0.14 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 18:09:20,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -133.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:20,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 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 18:09:20,188 INFO L168 Benchmark]: Boogie Preprocessor took 25.43 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 18:09:20,188 INFO L168 Benchmark]: RCFGBuilder took 385.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:20,189 INFO L168 Benchmark]: TraceAbstraction took 14757.73 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.0 GB in the beginning and 939.7 MB in the end (delta: 79.9 MB). Peak memory consumption was 568.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:20,189 INFO L168 Benchmark]: Witness Printer took 71.57 ms. Allocated memory is still 1.6 GB. Free memory was 939.7 MB in the beginning and 905.3 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:09:20,191 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.14 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 392.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -133.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.43 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 385.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14757.73 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.0 GB in the beginning and 939.7 MB in the end (delta: 79.9 MB). Peak memory consumption was 568.5 MB. Max. memory is 11.5 GB. * Witness Printer took 71.57 ms. Allocated memory is still 1.6 GB. Free memory was 939.7 MB in the beginning and 905.3 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] 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, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 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) [L758] 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)) [L759] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 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)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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)) [L761] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 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 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2608 SDtfs, 2953 SDslu, 7623 SDs, 0 SdLazy, 9413 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 24 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 11439 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 134941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...