/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:01,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:01,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:01,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:01,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:01,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:01,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:01,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:01,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:01,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:01,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:01,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:01,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:01,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:01,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:01,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:01,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:01,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:01,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:01,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:01,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:01,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:01,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:01,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:01,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:01,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:01,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:01,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:01,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:01,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:01,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:01,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:01,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:01,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:01,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:01,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:01,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:01,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:01,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:01,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:01,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:01,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:03:01,476 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:01,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:01,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:01,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:01,479 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:01,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:01,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:01,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:01,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:01,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:01,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:01,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:01,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:01,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:01,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:01,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:01,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:01,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:01,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:01,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:01,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:01,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:01,491 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:01,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:01,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:01,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:01,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:01,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:01,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:01,771 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:01,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 23:03:01,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56ffec61/371aedceecf94a978dec24cd34f71b37/FLAG312d50971 [2019-12-18 23:03:02,366 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:02,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 23:03:02,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56ffec61/371aedceecf94a978dec24cd34f71b37/FLAG312d50971 [2019-12-18 23:03:02,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56ffec61/371aedceecf94a978dec24cd34f71b37 [2019-12-18 23:03:02,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:02,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:02,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:02,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:02,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:02,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:02" (1/1) ... [2019-12-18 23:03:02,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:02, skipping insertion in model container [2019-12-18 23:03:02,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:02" (1/1) ... [2019-12-18 23:03:02,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:02,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:03,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:03,325 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:03,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:03,509 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:03,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03 WrapperNode [2019-12-18 23:03:03,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:03,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:03,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:03,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:03,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:03,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:03,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:03,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:03,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:03,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:03,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:03,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:03,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (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-12-18 23:03:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:03,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:03,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:03,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:03,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:03,686 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:04,393 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:04,393 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:04,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:04 BoogieIcfgContainer [2019-12-18 23:03:04,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:04,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:04,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:04,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:04,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:02" (1/3) ... [2019-12-18 23:03:04,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd6b971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:04, skipping insertion in model container [2019-12-18 23:03:04,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (2/3) ... [2019-12-18 23:03:04,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd6b971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:04, skipping insertion in model container [2019-12-18 23:03:04,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:04" (3/3) ... [2019-12-18 23:03:04,404 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-12-18 23:03:04,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:04,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:04,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:04,426 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:04,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,474 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,474 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,474 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:03:04,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:04,534 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:04,534 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:04,535 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:04,535 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:04,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:04,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:04,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:04,553 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 23:03:04,556 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:04,646 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:04,647 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:04,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:04,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:04,721 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:04,721 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:04,727 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:04,742 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 23:03:04,743 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:07,756 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 23:03:07,860 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 23:03:07,885 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48808 [2019-12-18 23:03:07,885 INFO L214 etLargeBlockEncoding]: Total number of compositions: 95 [2019-12-18 23:03:07,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 23:03:08,352 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-18 23:03:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-18 23:03:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:03:08,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:08,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:03:08,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 688178079, now seen corresponding path program 1 times [2019-12-18 23:03:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:08,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248317111] [2019-12-18 23:03:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:08,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248317111] [2019-12-18 23:03:08,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:08,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:03:08,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166697709] [2019-12-18 23:03:08,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:08,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:08,627 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-18 23:03:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:08,991 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-18 23:03:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:08,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:03:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:09,077 INFO L225 Difference]: With dead ends: 8560 [2019-12-18 23:03:09,077 INFO L226 Difference]: Without dead ends: 8391 [2019-12-18 23:03:09,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-18 23:03:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-18 23:03:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-18 23:03:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-18 23:03:09,517 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-18 23:03:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:09,518 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-18 23:03:09,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-18 23:03:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:09,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:09,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:09,524 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 530797982, now seen corresponding path program 1 times [2019-12-18 23:03:09,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:09,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288566008] [2019-12-18 23:03:09,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:09,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288566008] [2019-12-18 23:03:09,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:09,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:09,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414936406] [2019-12-18 23:03:09,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:09,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:09,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:09,705 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-18 23:03:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:10,259 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-18 23:03:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:10,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:10,351 INFO L225 Difference]: With dead ends: 13399 [2019-12-18 23:03:10,351 INFO L226 Difference]: Without dead ends: 13392 [2019-12-18 23:03:10,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-18 23:03:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 12075. [2019-12-18 23:03:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-12-18 23:03:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 38370 transitions. [2019-12-18 23:03:10,786 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 38370 transitions. Word has length 11 [2019-12-18 23:03:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:10,786 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 38370 transitions. [2019-12-18 23:03:10,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 38370 transitions. [2019-12-18 23:03:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:10,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:10,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:10,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1942568878, now seen corresponding path program 1 times [2019-12-18 23:03:10,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:10,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041132915] [2019-12-18 23:03:10,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:10,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041132915] [2019-12-18 23:03:10,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:10,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:10,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853293305] [2019-12-18 23:03:10,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:10,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:10,970 INFO L87 Difference]: Start difference. First operand 12075 states and 38370 transitions. Second operand 4 states. [2019-12-18 23:03:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:11,197 INFO L93 Difference]: Finished difference Result 15134 states and 47650 transitions. [2019-12-18 23:03:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:11,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:11,246 INFO L225 Difference]: With dead ends: 15134 [2019-12-18 23:03:11,247 INFO L226 Difference]: Without dead ends: 15134 [2019-12-18 23:03:11,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15134 states. [2019-12-18 23:03:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15134 to 13358. [2019-12-18 23:03:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13358 states. [2019-12-18 23:03:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13358 states to 13358 states and 42395 transitions. [2019-12-18 23:03:12,415 INFO L78 Accepts]: Start accepts. Automaton has 13358 states and 42395 transitions. Word has length 11 [2019-12-18 23:03:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:12,416 INFO L462 AbstractCegarLoop]: Abstraction has 13358 states and 42395 transitions. [2019-12-18 23:03:12,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13358 states and 42395 transitions. [2019-12-18 23:03:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:03:12,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:12,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:12,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash -608680593, now seen corresponding path program 1 times [2019-12-18 23:03:12,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:12,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802154768] [2019-12-18 23:03:12,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:12,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802154768] [2019-12-18 23:03:12,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:12,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:12,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192996662] [2019-12-18 23:03:12,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:12,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:12,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:12,511 INFO L87 Difference]: Start difference. First operand 13358 states and 42395 transitions. Second operand 5 states. [2019-12-18 23:03:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:12,971 INFO L93 Difference]: Finished difference Result 18128 states and 56297 transitions. [2019-12-18 23:03:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:12,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:03:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:13,019 INFO L225 Difference]: With dead ends: 18128 [2019-12-18 23:03:13,019 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 23:03:13,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 23:03:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 13400. [2019-12-18 23:03:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13400 states. [2019-12-18 23:03:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13400 states to 13400 states and 42387 transitions. [2019-12-18 23:03:13,590 INFO L78 Accepts]: Start accepts. Automaton has 13400 states and 42387 transitions. Word has length 17 [2019-12-18 23:03:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:13,591 INFO L462 AbstractCegarLoop]: Abstraction has 13400 states and 42387 transitions. [2019-12-18 23:03:13,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13400 states and 42387 transitions. [2019-12-18 23:03:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:13,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:13,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:13,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash -981631142, now seen corresponding path program 1 times [2019-12-18 23:03:13,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:13,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354029458] [2019-12-18 23:03:13,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:13,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354029458] [2019-12-18 23:03:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798022211] [2019-12-18 23:03:13,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:13,674 INFO L87 Difference]: Start difference. First operand 13400 states and 42387 transitions. Second operand 3 states. [2019-12-18 23:03:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:13,782 INFO L93 Difference]: Finished difference Result 16317 states and 50948 transitions. [2019-12-18 23:03:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:13,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 23:03:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:13,817 INFO L225 Difference]: With dead ends: 16317 [2019-12-18 23:03:13,817 INFO L226 Difference]: Without dead ends: 16317 [2019-12-18 23:03:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16317 states. [2019-12-18 23:03:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16317 to 14414. [2019-12-18 23:03:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14414 states. [2019-12-18 23:03:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14414 states to 14414 states and 45469 transitions. [2019-12-18 23:03:14,397 INFO L78 Accepts]: Start accepts. Automaton has 14414 states and 45469 transitions. Word has length 25 [2019-12-18 23:03:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,400 INFO L462 AbstractCegarLoop]: Abstraction has 14414 states and 45469 transitions. [2019-12-18 23:03:14,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14414 states and 45469 transitions. [2019-12-18 23:03:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:14,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:14,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -981816243, now seen corresponding path program 1 times [2019-12-18 23:03:14,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165638936] [2019-12-18 23:03:14,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:14,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165638936] [2019-12-18 23:03:14,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:14,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:14,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587242421] [2019-12-18 23:03:14,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:14,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:14,478 INFO L87 Difference]: Start difference. First operand 14414 states and 45469 transitions. Second operand 4 states. [2019-12-18 23:03:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:14,510 INFO L93 Difference]: Finished difference Result 2334 states and 5320 transitions. [2019-12-18 23:03:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:03:14,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 23:03:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:14,514 INFO L225 Difference]: With dead ends: 2334 [2019-12-18 23:03:14,514 INFO L226 Difference]: Without dead ends: 2048 [2019-12-18 23:03:14,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-12-18 23:03:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-12-18 23:03:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-12-18 23:03:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 4529 transitions. [2019-12-18 23:03:14,545 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 4529 transitions. Word has length 25 [2019-12-18 23:03:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,545 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 4529 transitions. [2019-12-18 23:03:14,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 4529 transitions. [2019-12-18 23:03:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 23:03:14,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,550 INFO L411 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] [2019-12-18 23:03:14,550 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1158183016, now seen corresponding path program 1 times [2019-12-18 23:03:14,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176143748] [2019-12-18 23:03:14,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:14,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176143748] [2019-12-18 23:03:14,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:14,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:14,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042739777] [2019-12-18 23:03:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:14,676 INFO L87 Difference]: Start difference. First operand 2048 states and 4529 transitions. Second operand 5 states. [2019-12-18 23:03:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:14,723 INFO L93 Difference]: Finished difference Result 426 states and 776 transitions. [2019-12-18 23:03:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:14,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 23:03:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:14,725 INFO L225 Difference]: With dead ends: 426 [2019-12-18 23:03:14,725 INFO L226 Difference]: Without dead ends: 380 [2019-12-18 23:03:14,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-18 23:03:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 345. [2019-12-18 23:03:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 23:03:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 621 transitions. [2019-12-18 23:03:14,731 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 621 transitions. Word has length 37 [2019-12-18 23:03:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,731 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 621 transitions. [2019-12-18 23:03:14,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 621 transitions. [2019-12-18 23:03:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 23:03:14,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:14,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1944342103, now seen corresponding path program 1 times [2019-12-18 23:03:14,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350871739] [2019-12-18 23:03:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350871739] [2019-12-18 23:03:14,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:14,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:14,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739081081] [2019-12-18 23:03:14,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:14,878 INFO L87 Difference]: Start difference. First operand 345 states and 621 transitions. Second operand 5 states. [2019-12-18 23:03:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,096 INFO L93 Difference]: Finished difference Result 476 states and 857 transitions. [2019-12-18 23:03:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:03:15,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 23:03:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,099 INFO L225 Difference]: With dead ends: 476 [2019-12-18 23:03:15,099 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 23:03:15,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 23:03:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 435. [2019-12-18 23:03:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 23:03:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 785 transitions. [2019-12-18 23:03:15,106 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 785 transitions. Word has length 52 [2019-12-18 23:03:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:15,107 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 785 transitions. [2019-12-18 23:03:15,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 785 transitions. [2019-12-18 23:03:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 23:03:15,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:15,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:15,109 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1307256259, now seen corresponding path program 2 times [2019-12-18 23:03:15,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:15,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213381] [2019-12-18 23:03:15,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213381] [2019-12-18 23:03:15,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:03:15,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681500562] [2019-12-18 23:03:15,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:15,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:15,213 INFO L87 Difference]: Start difference. First operand 435 states and 785 transitions. Second operand 6 states. [2019-12-18 23:03:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,562 INFO L93 Difference]: Finished difference Result 658 states and 1193 transitions. [2019-12-18 23:03:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:15,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 23:03:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,564 INFO L225 Difference]: With dead ends: 658 [2019-12-18 23:03:15,564 INFO L226 Difference]: Without dead ends: 658 [2019-12-18 23:03:15,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-18 23:03:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-12-18 23:03:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 23:03:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 875 transitions. [2019-12-18 23:03:15,572 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 875 transitions. Word has length 52 [2019-12-18 23:03:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:15,573 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 875 transitions. [2019-12-18 23:03:15,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 875 transitions. [2019-12-18 23:03:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 23:03:15,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:15,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:15,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash -438805035, now seen corresponding path program 3 times [2019-12-18 23:03:15,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:15,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814434769] [2019-12-18 23:03:15,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814434769] [2019-12-18 23:03:15,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:15,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16022503] [2019-12-18 23:03:15,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:15,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:15,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:15,634 INFO L87 Difference]: Start difference. First operand 480 states and 875 transitions. Second operand 3 states. [2019-12-18 23:03:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,647 INFO L93 Difference]: Finished difference Result 435 states and 770 transitions. [2019-12-18 23:03:15,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:15,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 23:03:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,648 INFO L225 Difference]: With dead ends: 435 [2019-12-18 23:03:15,648 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 23:03:15,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 23:03:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 423. [2019-12-18 23:03:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 23:03:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 748 transitions. [2019-12-18 23:03:15,654 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 748 transitions. Word has length 52 [2019-12-18 23:03:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:15,654 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 748 transitions. [2019-12-18 23:03:15,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 748 transitions. [2019-12-18 23:03:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 23:03:15,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:15,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:15,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1410277969, now seen corresponding path program 1 times [2019-12-18 23:03:15,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:15,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117110709] [2019-12-18 23:03:15,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117110709] [2019-12-18 23:03:15,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:15,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984177815] [2019-12-18 23:03:15,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:15,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:15,769 INFO L87 Difference]: Start difference. First operand 423 states and 748 transitions. Second operand 3 states. [2019-12-18 23:03:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,807 INFO L93 Difference]: Finished difference Result 422 states and 746 transitions. [2019-12-18 23:03:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:15,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 23:03:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,808 INFO L225 Difference]: With dead ends: 422 [2019-12-18 23:03:15,808 INFO L226 Difference]: Without dead ends: 422 [2019-12-18 23:03:15,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-18 23:03:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 344. [2019-12-18 23:03:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 23:03:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 606 transitions. [2019-12-18 23:03:15,814 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 606 transitions. Word has length 53 [2019-12-18 23:03:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:15,816 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 606 transitions. [2019-12-18 23:03:15,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 606 transitions. [2019-12-18 23:03:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:15,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:15,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:15,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1173138387, now seen corresponding path program 1 times [2019-12-18 23:03:15,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:15,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711828756] [2019-12-18 23:03:15,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711828756] [2019-12-18 23:03:16,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:16,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384642628] [2019-12-18 23:03:16,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:16,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:16,013 INFO L87 Difference]: Start difference. First operand 344 states and 606 transitions. Second operand 6 states. [2019-12-18 23:03:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,105 INFO L93 Difference]: Finished difference Result 558 states and 985 transitions. [2019-12-18 23:03:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:03:16,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 23:03:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,107 INFO L225 Difference]: With dead ends: 558 [2019-12-18 23:03:16,107 INFO L226 Difference]: Without dead ends: 233 [2019-12-18 23:03:16,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:03:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-18 23:03:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-18 23:03:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 23:03:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-18 23:03:16,111 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-12-18 23:03:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,111 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-18 23:03:16,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-18 23:03:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:16,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1337955311, now seen corresponding path program 2 times [2019-12-18 23:03:16,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052854995] [2019-12-18 23:03:16,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052854995] [2019-12-18 23:03:16,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:03:16,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715048502] [2019-12-18 23:03:16,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:03:16,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:03:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:03:16,535 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 13 states. [2019-12-18 23:03:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:17,135 INFO L93 Difference]: Finished difference Result 375 states and 638 transitions. [2019-12-18 23:03:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:03:17,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 23:03:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:17,137 INFO L225 Difference]: With dead ends: 375 [2019-12-18 23:03:17,137 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 23:03:17,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:03:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 23:03:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-18 23:03:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 23:03:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-18 23:03:17,142 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 54 [2019-12-18 23:03:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:17,142 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-18 23:03:17,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:03:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-18 23:03:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:17,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:17,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:17,144 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1670843661, now seen corresponding path program 3 times [2019-12-18 23:03:17,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:17,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782404028] [2019-12-18 23:03:17,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:17,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782404028] [2019-12-18 23:03:17,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:17,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:03:17,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594371888] [2019-12-18 23:03:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 23:03:17,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 23:03:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:03:17,937 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 20 states. [2019-12-18 23:03:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,961 INFO L93 Difference]: Finished difference Result 579 states and 972 transitions. [2019-12-18 23:03:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:03:19,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-18 23:03:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,963 INFO L225 Difference]: With dead ends: 579 [2019-12-18 23:03:19,963 INFO L226 Difference]: Without dead ends: 547 [2019-12-18 23:03:19,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:03:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-12-18 23:03:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 319. [2019-12-18 23:03:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 23:03:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 554 transitions. [2019-12-18 23:03:19,970 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 554 transitions. Word has length 54 [2019-12-18 23:03:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,971 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 554 transitions. [2019-12-18 23:03:19,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 23:03:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 554 transitions. [2019-12-18 23:03:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:19,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:19,972 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1370214765, now seen corresponding path program 4 times [2019-12-18 23:03:19,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310662800] [2019-12-18 23:03:19,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:20,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310662800] [2019-12-18 23:03:20,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:20,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:03:20,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639620104] [2019-12-18 23:03:20,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:03:20,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:03:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:03:20,219 INFO L87 Difference]: Start difference. First operand 319 states and 554 transitions. Second operand 12 states. [2019-12-18 23:03:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:20,642 INFO L93 Difference]: Finished difference Result 421 states and 707 transitions. [2019-12-18 23:03:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:03:20,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 23:03:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:20,644 INFO L225 Difference]: With dead ends: 421 [2019-12-18 23:03:20,644 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 23:03:20,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:03:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 23:03:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 317. [2019-12-18 23:03:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 23:03:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-18 23:03:20,652 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 54 [2019-12-18 23:03:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-18 23:03:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:03:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-18 23:03:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:20,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:20,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:20,654 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 57952661, now seen corresponding path program 5 times [2019-12-18 23:03:20,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:20,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309290088] [2019-12-18 23:03:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:20,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:03:20,784 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:03:20,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_15 0) (= v_~x$flush_delayed~0_15 0) (= v_~x~0_28 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19|)) (= 0 |v_ULTIMATE.start_main_~#t2475~0.offset_16|) (= 0 v_~x$w_buff0_used~0_107) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (= 0 v_~x$r_buff0_thd1~0_18) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice2~0_36) (= 0 v_~x$r_buff0_thd2~0_23) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_46 0) (= |v_#NULL.offset_5| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2475~0.base_19| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19|) |v_ULTIMATE.start_main_~#t2475~0.offset_16| 0)) |v_#memory_int_17|) (= v_~x$mem_tmp~0_11 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2475~0.base_19|) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19| 1) |v_#valid_40|) (= 0 v_~x$w_buff0~0_29) (= v_~x$r_buff1_thd1~0_17 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_16|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_18, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_14|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t2475~0.offset=|v_ULTIMATE.start_main_~#t2475~0.offset_16|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_13|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_16|, ULTIMATE.start_main_~#t2475~0.base=|v_ULTIMATE.start_main_~#t2475~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ULTIMATE.start_main_~#t2476~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2475~0.offset, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2476~0.offset, ULTIMATE.start_main_~#t2475~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 23:03:20,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10|) |v_ULTIMATE.start_main_~#t2476~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2476~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2476~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2476~0.offset_9|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2476~0.base_10| 4)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2476~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2476~0.base] because there is no mapped edge [2019-12-18 23:03:20,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1_~arg.offset_Out1160157701 |P1Thread1of1ForFork1_#in~arg.offset_In1160157701|) (= |P1Thread1of1ForFork1_#in~arg.base_In1160157701| P1Thread1of1ForFork1_~arg.base_Out1160157701) (= 0 (mod ~x$w_buff1_used~0_Out1160157701 256)) (= ~x$w_buff0_used~0_Out1160157701 1) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1160157701|) (= ~x$w_buff1~0_Out1160157701 ~x$w_buff0~0_In1160157701) (= ~x$w_buff0_used~0_In1160157701 ~x$w_buff1_used~0_Out1160157701) (= 2 ~x$w_buff0~0_Out1160157701) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1160157701 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1160157701|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1160157701, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1160157701|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1160157701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1160157701} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1160157701, ~x$w_buff0~0=~x$w_buff0~0_Out1160157701, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out1160157701, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1160157701|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out1160157701, ~x$w_buff1~0=~x$w_buff1~0_Out1160157701, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1160157701|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1160157701|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1160157701, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1160157701} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 23:03:20,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-251996984| |P0Thread1of1ForFork0_#t~ite4_Out-251996984|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-251996984 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-251996984 256) 0))) (or (and .cse0 (= ~x~0_In-251996984 |P0Thread1of1ForFork0_#t~ite3_Out-251996984|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-251996984| ~x$w_buff1~0_In-251996984) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-251996984, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-251996984, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-251996984, ~x~0=~x~0_In-251996984} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-251996984|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-251996984|, ~x$w_buff1~0=~x$w_buff1~0_In-251996984, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-251996984, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-251996984, ~x~0=~x~0_In-251996984} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 23:03:20,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In448585603 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In448585603 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out448585603| ~x$w_buff0_used~0_In448585603) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out448585603| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In448585603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448585603} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out448585603|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In448585603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448585603} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 23:03:20,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In70259354 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In70259354 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out70259354|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out70259354| ~x$w_buff0_used~0_In70259354) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In70259354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In70259354} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out70259354|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In70259354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In70259354} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 23:03:20,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In294671905 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In294671905 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In294671905 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In294671905 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out294671905| ~x$w_buff1_used~0_In294671905) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out294671905| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In294671905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In294671905, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In294671905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In294671905} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out294671905|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In294671905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In294671905, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In294671905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In294671905} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 23:03:20,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1053975859 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1053975859 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In1053975859 |P0Thread1of1ForFork0_#t~ite7_Out1053975859|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1053975859|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053975859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053975859} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053975859, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1053975859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053975859} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 23:03:20,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In367896371 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In367896371 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In367896371 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In367896371 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out367896371| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out367896371| ~x$r_buff1_thd1~0_In367896371) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In367896371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367896371, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In367896371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367896371} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In367896371, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out367896371|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367896371, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In367896371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367896371} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 23:03:20,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 23:03:20,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1622388286 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1622388286 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1622388286 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1622388286 256)))) (or (and (= ~x$w_buff1_used~0_In-1622388286 |P1Thread1of1ForFork1_#t~ite12_Out-1622388286|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1622388286| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1622388286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1622388286, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1622388286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1622388286} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1622388286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1622388286, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1622388286|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1622388286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1622388286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 23:03:20,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1052693782 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1052693782 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1052693782)) (and (= ~x$r_buff0_thd2~0_In-1052693782 ~x$r_buff0_thd2~0_Out-1052693782) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1052693782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1052693782} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1052693782|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1052693782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1052693782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 23:03:20,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2139258138 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2139258138 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In2139258138 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2139258138 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2139258138| ~x$r_buff1_thd2~0_In2139258138) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out2139258138| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2139258138, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2139258138, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2139258138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2139258138} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2139258138, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2139258138, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2139258138, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2139258138|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2139258138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:03:20,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L758-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 23:03:20,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$r_buff0_thd0~0_47 256) 0) (= (mod v_~x$w_buff0_used~0_70 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 23:03:20,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2099700469 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2099700469 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-2099700469 |ULTIMATE.start_main_#t~ite17_Out-2099700469|)) (and (= |ULTIMATE.start_main_#t~ite17_Out-2099700469| ~x$w_buff1~0_In-2099700469) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2099700469, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099700469, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099700469, ~x~0=~x~0_In-2099700469} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2099700469|, ~x$w_buff1~0=~x$w_buff1~0_In-2099700469, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099700469, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099700469, ~x~0=~x~0_In-2099700469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 23:03:20,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 23:03:20,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In191237406 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In191237406 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out191237406|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In191237406 |ULTIMATE.start_main_#t~ite19_Out191237406|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In191237406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In191237406} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In191237406, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out191237406|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In191237406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 23:03:20,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-538562724 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-538562724 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-538562724 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-538562724 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-538562724| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out-538562724| ~x$w_buff1_used~0_In-538562724) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-538562724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-538562724, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-538562724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-538562724} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-538562724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-538562724, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-538562724|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-538562724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-538562724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 23:03:20,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1051161776 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1051161776 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1051161776|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1051161776 |ULTIMATE.start_main_#t~ite21_Out-1051161776|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1051161776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1051161776} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1051161776, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1051161776|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1051161776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 23:03:20,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1719490122 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1719490122 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1719490122 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1719490122 256)))) (or (and (= ~x$r_buff1_thd0~0_In-1719490122 |ULTIMATE.start_main_#t~ite22_Out-1719490122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1719490122|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1719490122, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1719490122, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1719490122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1719490122} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1719490122, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1719490122, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1719490122, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1719490122|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1719490122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 23:03:20,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In682317984 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In682317984 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In682317984 256) 0)) (.cse4 (= |ULTIMATE.start_main_#t~ite38_Out682317984| |ULTIMATE.start_main_#t~ite37_Out682317984|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In682317984 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In682317984 256)))) (or (and (or (and (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) .cse4 .cse5 (= ~x$w_buff1_used~0_In682317984 |ULTIMATE.start_main_#t~ite37_Out682317984|)) (and (= |ULTIMATE.start_main_#t~ite37_Out682317984| |ULTIMATE.start_main_#t~ite37_In682317984|) (not .cse5) (= ~x$w_buff1_used~0_In682317984 |ULTIMATE.start_main_#t~ite38_Out682317984|))) (= |ULTIMATE.start_main_#t~ite36_In682317984| |ULTIMATE.start_main_#t~ite36_Out682317984|)) (let ((.cse6 (not .cse0))) (and (= 0 |ULTIMATE.start_main_#t~ite36_Out682317984|) (or (not .cse1) .cse6) (or .cse6 (not .cse2)) (not .cse3) (= |ULTIMATE.start_main_#t~ite37_Out682317984| |ULTIMATE.start_main_#t~ite36_Out682317984|) .cse4 .cse5)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In682317984, ~x$w_buff1_used~0=~x$w_buff1_used~0_In682317984, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In682317984|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In682317984|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In682317984, ~weak$$choice2~0=~weak$$choice2~0_In682317984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In682317984} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In682317984, ~x$w_buff1_used~0=~x$w_buff1_used~0_In682317984, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out682317984|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out682317984|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out682317984|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In682317984, ~weak$$choice2~0=~weak$$choice2~0_In682317984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In682317984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 23:03:20,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd0~0_51 v_~x$r_buff0_thd0~0_50)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 23:03:20,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L804-->L4: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:03:20,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:03:20,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:03:20 BasicIcfg [2019-12-18 23:03:20,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:03:20,908 INFO L168 Benchmark]: Toolchain (without parser) took 18192.27 ms. Allocated memory was 146.3 MB in the beginning and 762.8 MB in the end (delta: 616.6 MB). Free memory was 102.7 MB in the beginning and 472.2 MB in the end (delta: -369.5 MB). Peak memory consumption was 247.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,909 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.83 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,918 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,919 INFO L168 Benchmark]: RCFGBuilder took 769.16 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.6 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,921 INFO L168 Benchmark]: TraceAbstraction took 16509.17 ms. Allocated memory was 203.4 MB in the beginning and 762.8 MB in the end (delta: 559.4 MB). Free memory was 108.6 MB in the beginning and 472.2 MB in the end (delta: -363.6 MB). Peak memory consumption was 195.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:20,925 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.46 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.83 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 157.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.16 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.6 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16509.17 ms. Allocated memory was 203.4 MB in the beginning and 762.8 MB in the end (delta: 559.4 MB). Free memory was 108.6 MB in the beginning and 472.2 MB in the end (delta: -363.6 MB). Peak memory consumption was 195.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 26 ChoiceCompositions, 3565 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48808 CheckedPairsTotal, 95 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1617 SDtfs, 1674 SDslu, 3997 SDs, 0 SdLazy, 2882 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14414occurred 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: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 10419 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 119420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...