./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fe6c6829814f0f98d8e397eaf5ef61f86453ef64 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:22:34,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:34,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:34,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:34,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:34,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:34,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:34,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:34,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:34,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:34,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:34,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:34,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:34,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:34,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:34,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:34,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:34,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:34,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:34,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:34,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:34,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:34,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:34,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:34,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:34,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:34,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:34,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:34,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:34,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:34,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:34,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:34,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:34,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:34,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:34,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:34,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:34,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:34,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:34,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:34,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:34,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:22:34,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:34,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:34,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:34,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:34,459 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:34,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:34,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:34,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:34,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:34,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:34,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:34,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:34,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:34,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:34,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:34,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:34,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:34,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:34,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:34,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:34,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:34,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:34,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:34,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:34,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:34,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:34,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:34,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:34,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:34,467 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fe6c6829814f0f98d8e397eaf5ef61f86453ef64 [2019-11-28 18:22:34,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:34,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:34,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:34,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:34,832 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:34,832 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i [2019-11-28 18:22:34,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c9d6cde/141fbed9956b42cd96fa0c8d8ca6b05f/FLAG37b24f62c [2019-11-28 18:22:35,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:35,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i [2019-11-28 18:22:35,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c9d6cde/141fbed9956b42cd96fa0c8d8ca6b05f/FLAG37b24f62c [2019-11-28 18:22:35,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c9d6cde/141fbed9956b42cd96fa0c8d8ca6b05f [2019-11-28 18:22:35,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:35,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:35,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:35,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:35,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:35,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f677360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35, skipping insertion in model container [2019-11-28 18:22:35,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:35,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:36,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:36,378 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:36,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:36,549 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:36,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36 WrapperNode [2019-11-28 18:22:36,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:36,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:36,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:36,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:36,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:36,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:36,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:36,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:36,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:36,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:36,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:36,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:36,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:22:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:36,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:36,725 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:22:37,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:37,323 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:37,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37 BoogieIcfgContainer [2019-11-28 18:22:37,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:37,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:37,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:37,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:37,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:35" (1/3) ... [2019-11-28 18:22:37,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:37, skipping insertion in model container [2019-11-28 18:22:37,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (2/3) ... [2019-11-28 18:22:37,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:37, skipping insertion in model container [2019-11-28 18:22:37,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37" (3/3) ... [2019-11-28 18:22:37,334 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt.i [2019-11-28 18:22:37,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:37,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:37,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:37,361 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:37,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:37,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:37,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:37,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:37,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:37,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:37,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:37,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:37,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:37,484 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-11-28 18:22:37,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:37,566 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:37,566 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:37,581 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:37,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:37,643 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:37,644 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:37,649 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:37,664 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:37,665 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:41,804 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:22:41,941 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:22:42,022 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-11-28 18:22:42,022 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-11-28 18:22:42,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:22:42,532 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-11-28 18:22:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-11-28 18:22:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:42,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:42,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:42,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-11-28 18:22:42,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:42,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842609386] [2019-11-28 18:22:42,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:42,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842609386] [2019-11-28 18:22:42,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:42,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:42,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072565613] [2019-11-28 18:22:42,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:42,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:43,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:43,004 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-11-28 18:22:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:43,309 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-11-28 18:22:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:43,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:43,400 INFO L225 Difference]: With dead ends: 6636 [2019-11-28 18:22:43,400 INFO L226 Difference]: Without dead ends: 6246 [2019-11-28 18:22:43,402 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-11-28 18:22:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-11-28 18:22:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-11-28 18:22:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-11-28 18:22:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-11-28 18:22:43,825 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-11-28 18:22:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:43,826 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-11-28 18:22:43,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-11-28 18:22:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:43,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:43,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:43,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-11-28 18:22:43,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:43,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409443971] [2019-11-28 18:22:43,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:43,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409443971] [2019-11-28 18:22:43,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:43,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:43,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597440358] [2019-11-28 18:22:44,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:44,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:44,001 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-11-28 18:22:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:44,337 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-11-28 18:22:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:44,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:44,409 INFO L225 Difference]: With dead ends: 9424 [2019-11-28 18:22:44,409 INFO L226 Difference]: Without dead ends: 9411 [2019-11-28 18:22:44,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-11-28 18:22:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-11-28 18:22:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-11-28 18:22:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-11-28 18:22:44,770 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-11-28 18:22:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:44,770 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-11-28 18:22:44,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-11-28 18:22:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:44,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:44,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:44,775 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-11-28 18:22:44,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:44,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056565630] [2019-11-28 18:22:44,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:44,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056565630] [2019-11-28 18:22:44,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:44,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:44,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838758] [2019-11-28 18:22:44,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:44,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:44,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:44,829 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-11-28 18:22:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:44,977 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-11-28 18:22:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:44,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:45,042 INFO L225 Difference]: With dead ends: 11392 [2019-11-28 18:22:45,043 INFO L226 Difference]: Without dead ends: 11392 [2019-11-28 18:22:45,043 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-11-28 18:22:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-11-28 18:22:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-11-28 18:22:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-11-28 18:22:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-11-28 18:22:45,533 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-11-28 18:22:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:45,535 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-11-28 18:22:45,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-11-28 18:22:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:45,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:45,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:45,539 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:45,540 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-11-28 18:22:45,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:45,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291355269] [2019-11-28 18:22:45,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:45,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291355269] [2019-11-28 18:22:45,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:45,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:45,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490503879] [2019-11-28 18:22:45,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:45,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:45,655 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-11-28 18:22:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:45,893 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-11-28 18:22:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:45,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:45,938 INFO L225 Difference]: With dead ends: 12648 [2019-11-28 18:22:45,939 INFO L226 Difference]: Without dead ends: 12637 [2019-11-28 18:22:45,939 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-11-28 18:22:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-11-28 18:22:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-11-28 18:22:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-11-28 18:22:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-11-28 18:22:46,290 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-11-28 18:22:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:46,291 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-11-28 18:22:46,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-11-28 18:22:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:46,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:46,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:46,295 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:46,295 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-11-28 18:22:46,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:46,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303184595] [2019-11-28 18:22:46,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303184595] [2019-11-28 18:22:46,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:46,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:46,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127418659] [2019-11-28 18:22:46,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:46,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:46,365 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-11-28 18:22:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:46,573 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-11-28 18:22:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:46,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:46,636 INFO L225 Difference]: With dead ends: 13620 [2019-11-28 18:22:46,637 INFO L226 Difference]: Without dead ends: 13607 [2019-11-28 18:22:46,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-11-28 18:22:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-11-28 18:22:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-28 18:22:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-11-28 18:22:47,227 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-11-28 18:22:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,228 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-11-28 18:22:47,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-11-28 18:22:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:47,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:47,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-11-28 18:22:47,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931409276] [2019-11-28 18:22:47,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:47,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931409276] [2019-11-28 18:22:47,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:47,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:47,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646651080] [2019-11-28 18:22:47,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:47,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:47,376 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-11-28 18:22:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:47,448 INFO L93 Difference]: Finished difference Result 11004 states and 35187 transitions. [2019-11-28 18:22:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:47,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:47,499 INFO L225 Difference]: With dead ends: 11004 [2019-11-28 18:22:47,499 INFO L226 Difference]: Without dead ends: 11004 [2019-11-28 18:22:47,500 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-11-28 18:22:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11004 states. [2019-11-28 18:22:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11004 to 10806. [2019-11-28 18:22:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10806 states. [2019-11-28 18:22:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10806 states to 10806 states and 34589 transitions. [2019-11-28 18:22:47,775 INFO L78 Accepts]: Start accepts. Automaton has 10806 states and 34589 transitions. Word has length 16 [2019-11-28 18:22:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,775 INFO L462 AbstractCegarLoop]: Abstraction has 10806 states and 34589 transitions. [2019-11-28 18:22:47,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 10806 states and 34589 transitions. [2019-11-28 18:22:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:47,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:47,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 568392815, now seen corresponding path program 1 times [2019-11-28 18:22:47,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741198312] [2019-11-28 18:22:47,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:47,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741198312] [2019-11-28 18:22:47,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:47,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:47,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157067182] [2019-11-28 18:22:47,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:47,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:47,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:47,869 INFO L87 Difference]: Start difference. First operand 10806 states and 34589 transitions. Second operand 3 states. [2019-11-28 18:22:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:47,934 INFO L93 Difference]: Finished difference Result 10691 states and 34195 transitions. [2019-11-28 18:22:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:47,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:47,961 INFO L225 Difference]: With dead ends: 10691 [2019-11-28 18:22:47,961 INFO L226 Difference]: Without dead ends: 10691 [2019-11-28 18:22:47,962 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-11-28 18:22:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10691 states. [2019-11-28 18:22:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10691 to 10683. [2019-11-28 18:22:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10683 states. [2019-11-28 18:22:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10683 states to 10683 states and 34183 transitions. [2019-11-28 18:22:48,217 INFO L78 Accepts]: Start accepts. Automaton has 10683 states and 34183 transitions. Word has length 16 [2019-11-28 18:22:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,217 INFO L462 AbstractCegarLoop]: Abstraction has 10683 states and 34183 transitions. [2019-11-28 18:22:48,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 10683 states and 34183 transitions. [2019-11-28 18:22:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:22:48,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:48,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash -832349724, now seen corresponding path program 1 times [2019-11-28 18:22:48,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452794359] [2019-11-28 18:22:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:48,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452794359] [2019-11-28 18:22:48,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:48,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036281131] [2019-11-28 18:22:48,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:48,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:48,285 INFO L87 Difference]: Start difference. First operand 10683 states and 34183 transitions. Second operand 4 states. [2019-11-28 18:22:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,315 INFO L93 Difference]: Finished difference Result 2214 states and 5802 transitions. [2019-11-28 18:22:48,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:48,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:22:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,319 INFO L225 Difference]: With dead ends: 2214 [2019-11-28 18:22:48,319 INFO L226 Difference]: Without dead ends: 1582 [2019-11-28 18:22:48,319 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-11-28 18:22:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-11-28 18:22:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2019-11-28 18:22:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2019-11-28 18:22:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 3772 transitions. [2019-11-28 18:22:48,346 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 3772 transitions. Word has length 18 [2019-11-28 18:22:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,347 INFO L462 AbstractCegarLoop]: Abstraction has 1582 states and 3772 transitions. [2019-11-28 18:22:48,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 3772 transitions. [2019-11-28 18:22:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:48,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,350 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] [2019-11-28 18:22:48,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-11-28 18:22:48,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694967272] [2019-11-28 18:22:48,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:48,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694967272] [2019-11-28 18:22:48,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:48,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137234178] [2019-11-28 18:22:48,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:48,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:48,424 INFO L87 Difference]: Start difference. First operand 1582 states and 3772 transitions. Second operand 5 states. [2019-11-28 18:22:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,472 INFO L93 Difference]: Finished difference Result 791 states and 1818 transitions. [2019-11-28 18:22:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:48,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,474 INFO L225 Difference]: With dead ends: 791 [2019-11-28 18:22:48,474 INFO L226 Difference]: Without dead ends: 716 [2019-11-28 18:22:48,474 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-11-28 18:22:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-28 18:22:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-11-28 18:22:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-28 18:22:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1637 transitions. [2019-11-28 18:22:48,485 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1637 transitions. Word has length 26 [2019-11-28 18:22:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,486 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1637 transitions. [2019-11-28 18:22:48,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1637 transitions. [2019-11-28 18:22:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:48,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:48,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-11-28 18:22:48,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620522335] [2019-11-28 18:22:48,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:48,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620522335] [2019-11-28 18:22:48,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:22:48,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409029499] [2019-11-28 18:22:48,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:48,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:48,651 INFO L87 Difference]: Start difference. First operand 716 states and 1637 transitions. Second operand 6 states. [2019-11-28 18:22:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,881 INFO L93 Difference]: Finished difference Result 1836 states and 4152 transitions. [2019-11-28 18:22:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:48,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:22:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,884 INFO L225 Difference]: With dead ends: 1836 [2019-11-28 18:22:48,884 INFO L226 Difference]: Without dead ends: 1248 [2019-11-28 18:22:48,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-11-28 18:22:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 788. [2019-11-28 18:22:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-28 18:22:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1805 transitions. [2019-11-28 18:22:48,902 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1805 transitions. Word has length 42 [2019-11-28 18:22:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,902 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1805 transitions. [2019-11-28 18:22:48,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1805 transitions. [2019-11-28 18:22:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:48,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:48,906 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-11-28 18:22:48,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969112097] [2019-11-28 18:22:48,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:49,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969112097] [2019-11-28 18:22:49,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:49,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223631587] [2019-11-28 18:22:49,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:49,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:49,060 INFO L87 Difference]: Start difference. First operand 788 states and 1805 transitions. Second operand 5 states. [2019-11-28 18:22:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,095 INFO L93 Difference]: Finished difference Result 1266 states and 2914 transitions. [2019-11-28 18:22:49,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:49,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:22:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,098 INFO L225 Difference]: With dead ends: 1266 [2019-11-28 18:22:49,098 INFO L226 Difference]: Without dead ends: 498 [2019-11-28 18:22:49,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-28 18:22:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2019-11-28 18:22:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-11-28 18:22:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1142 transitions. [2019-11-28 18:22:49,106 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1142 transitions. Word has length 42 [2019-11-28 18:22:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,106 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1142 transitions. [2019-11-28 18:22:49,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1142 transitions. [2019-11-28 18:22:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:49,109 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 3 times [2019-11-28 18:22:49,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442986499] [2019-11-28 18:22:49,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:49,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442986499] [2019-11-28 18:22:49,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:49,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931500877] [2019-11-28 18:22:49,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:22:49,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:22:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,202 INFO L87 Difference]: Start difference. First operand 498 states and 1142 transitions. Second operand 7 states. [2019-11-28 18:22:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,378 INFO L93 Difference]: Finished difference Result 866 states and 1944 transitions. [2019-11-28 18:22:49,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:22:49,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:22:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,380 INFO L225 Difference]: With dead ends: 866 [2019-11-28 18:22:49,380 INFO L226 Difference]: Without dead ends: 580 [2019-11-28 18:22:49,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-28 18:22:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 514. [2019-11-28 18:22:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-11-28 18:22:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1172 transitions. [2019-11-28 18:22:49,391 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1172 transitions. Word has length 42 [2019-11-28 18:22:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,391 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1172 transitions. [2019-11-28 18:22:49,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:22:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1172 transitions. [2019-11-28 18:22:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:49,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 4 times [2019-11-28 18:22:49,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355271935] [2019-11-28 18:22:49,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:49,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:49,505 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:49,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~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_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~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, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:22:49,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:49,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:49,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1686927111 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1686927111 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1686927111|) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1686927111| ~y$w_buff0_used~0_In-1686927111) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686927111, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1686927111} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686927111, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1686927111, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1686927111|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:49,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-68190546 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-68190546 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-68190546 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-68190546 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-68190546| ~y$w_buff1_used~0_In-68190546) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-68190546| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-68190546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68190546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68190546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68190546} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-68190546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68190546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68190546, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-68190546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68190546} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:49,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In-658690194 ~y$r_buff0_thd2~0_Out-658690194)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-658690194 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-658690194 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out-658690194 0) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-658690194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658690194} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-658690194, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-658690194|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-658690194} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:49,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In265111407 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In265111407 |P0Thread1of1ForFork1_#t~ite18_Out265111407|) (= |P0Thread1of1ForFork1_#t~ite17_In265111407| |P0Thread1of1ForFork1_#t~ite17_Out265111407|)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite18_Out265111407| |P0Thread1of1ForFork1_#t~ite17_Out265111407|) (= ~y$w_buff1_used~0_In265111407 |P0Thread1of1ForFork1_#t~ite17_Out265111407|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In265111407 256)))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In265111407 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In265111407 256)) (and (= (mod ~y$w_buff1_used~0_In265111407 256) 0) .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In265111407, ~y$w_buff0_used~0=~y$w_buff0_used~0_In265111407, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In265111407, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In265111407|, ~weak$$choice2~0=~weak$$choice2~0_In265111407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In265111407} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In265111407, ~y$w_buff0_used~0=~y$w_buff0_used~0_In265111407, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In265111407, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out265111407|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out265111407|, ~weak$$choice2~0=~weak$$choice2~0_In265111407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In265111407} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:49,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:49,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:49,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In817152628 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In817152628 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In817152628 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In817152628 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out817152628|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out817152628| ~y$r_buff1_thd2~0_In817152628) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817152628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817152628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817152628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817152628} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817152628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817152628, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out817152628|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817152628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817152628} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:49,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:49,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:49,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In47745823 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In47745823 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out47745823| ~y$w_buff1~0_In47745823) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite34_Out47745823| ~y~0_In47745823) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In47745823, ~y~0=~y~0_In47745823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In47745823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In47745823} OutVars{~y$w_buff1~0=~y$w_buff1~0_In47745823, ~y~0=~y~0_In47745823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In47745823, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out47745823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In47745823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In740367210 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In740367210 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out740367210| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out740367210| ~y$w_buff0_used~0_In740367210) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In740367210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740367210} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In740367210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740367210, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out740367210|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:49,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-180679037 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-180679037 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-180679037 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-180679037 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-180679037|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-180679037 |ULTIMATE.start_main_#t~ite37_Out-180679037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180679037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180679037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180679037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180679037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180679037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180679037, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-180679037|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180679037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180679037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:49,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1561615307 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1561615307 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1561615307|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1561615307| ~y$r_buff0_thd0~0_In-1561615307) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561615307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561615307} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561615307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561615307, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1561615307|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:49,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1406319336 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1406319336 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1406319336 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1406319336 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1406319336 |ULTIMATE.start_main_#t~ite39_Out-1406319336|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1406319336|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406319336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406319336, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1406319336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406319336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406319336, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1406319336|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406319336, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1406319336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406319336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:49,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:49,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:49 BasicIcfg [2019-11-28 18:22:49,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:49,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:49,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:49,631 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:49,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37" (3/4) ... [2019-11-28 18:22:49,634 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:49,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~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_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~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, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:22:49,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:49,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:49,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1686927111 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1686927111 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1686927111|) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1686927111| ~y$w_buff0_used~0_In-1686927111) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686927111, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1686927111} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686927111, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1686927111, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1686927111|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:49,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-68190546 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-68190546 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-68190546 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-68190546 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-68190546| ~y$w_buff1_used~0_In-68190546) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-68190546| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-68190546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68190546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68190546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68190546} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-68190546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-68190546, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-68190546, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-68190546|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-68190546} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:49,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In-658690194 ~y$r_buff0_thd2~0_Out-658690194)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-658690194 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-658690194 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out-658690194 0) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-658690194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658690194} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-658690194, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-658690194|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-658690194} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:49,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In265111407 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In265111407 |P0Thread1of1ForFork1_#t~ite18_Out265111407|) (= |P0Thread1of1ForFork1_#t~ite17_In265111407| |P0Thread1of1ForFork1_#t~ite17_Out265111407|)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite18_Out265111407| |P0Thread1of1ForFork1_#t~ite17_Out265111407|) (= ~y$w_buff1_used~0_In265111407 |P0Thread1of1ForFork1_#t~ite17_Out265111407|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In265111407 256)))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In265111407 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In265111407 256)) (and (= (mod ~y$w_buff1_used~0_In265111407 256) 0) .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In265111407, ~y$w_buff0_used~0=~y$w_buff0_used~0_In265111407, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In265111407, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In265111407|, ~weak$$choice2~0=~weak$$choice2~0_In265111407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In265111407} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In265111407, ~y$w_buff0_used~0=~y$w_buff0_used~0_In265111407, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In265111407, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out265111407|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out265111407|, ~weak$$choice2~0=~weak$$choice2~0_In265111407, ~y$w_buff1_used~0=~y$w_buff1_used~0_In265111407} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:49,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:49,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:49,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In817152628 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In817152628 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In817152628 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In817152628 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out817152628|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out817152628| ~y$r_buff1_thd2~0_In817152628) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817152628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817152628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817152628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817152628} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817152628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817152628, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out817152628|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817152628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817152628} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:49,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:49,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:49,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In47745823 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In47745823 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out47745823| ~y$w_buff1~0_In47745823) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite34_Out47745823| ~y~0_In47745823) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In47745823, ~y~0=~y~0_In47745823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In47745823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In47745823} OutVars{~y$w_buff1~0=~y$w_buff1~0_In47745823, ~y~0=~y~0_In47745823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In47745823, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out47745823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In47745823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In740367210 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In740367210 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out740367210| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out740367210| ~y$w_buff0_used~0_In740367210) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In740367210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740367210} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In740367210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740367210, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out740367210|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:49,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-180679037 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-180679037 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-180679037 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-180679037 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-180679037|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-180679037 |ULTIMATE.start_main_#t~ite37_Out-180679037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180679037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180679037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180679037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180679037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180679037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180679037, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-180679037|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180679037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180679037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:49,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1561615307 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1561615307 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1561615307|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1561615307| ~y$r_buff0_thd0~0_In-1561615307) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561615307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561615307} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561615307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561615307, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1561615307|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:49,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1406319336 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1406319336 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1406319336 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1406319336 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1406319336 |ULTIMATE.start_main_#t~ite39_Out-1406319336|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1406319336|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406319336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406319336, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1406319336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406319336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406319336, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1406319336|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406319336, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1406319336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1406319336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:49,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:49,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:49,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:49,749 INFO L168 Benchmark]: Toolchain (without parser) took 13947.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 430.4 MB). Free memory was 955.0 MB in the beginning and 688.3 MB in the end (delta: 266.7 MB). Peak memory consumption was 697.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,750 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:49,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -107.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:49,751 INFO L168 Benchmark]: Boogie Preprocessor took 33.89 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,752 INFO L168 Benchmark]: RCFGBuilder took 675.52 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,753 INFO L168 Benchmark]: TraceAbstraction took 12304.49 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 700.6 MB in the end (delta: 309.7 MB). Peak memory consumption was 644.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,753 INFO L168 Benchmark]: Witness Printer took 117.52 ms. Allocated memory is still 1.5 GB. Free memory was 700.6 MB in the beginning and 688.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,756 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 748.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -107.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.89 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 675.52 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12304.49 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 700.6 MB in the end (delta: 309.7 MB). Peak memory consumption was 644.7 MB. Max. memory is 11.5 GB. * Witness Printer took 117.52 ms. Allocated memory is still 1.5 GB. Free memory was 700.6 MB in the beginning and 688.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1659, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1660, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 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, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 1452 SDslu, 2272 SDs, 0 SdLazy, 719 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 6153 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 39272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...