/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:04,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:04,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:04,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:04,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:04,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:04,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:04,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:04,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:04,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:04,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:04,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:04,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:04,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:04,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:04,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:04,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:04,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:04,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:04,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:04,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:04,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:04,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:04,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:04,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:04,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:04,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:04,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:04,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:04,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:04,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:04,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:04,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:04,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:04,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:04,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:04,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:04,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:04,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:04,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:04,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:04,558 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-SemanticLbe.epf [2019-12-18 19:04:04,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:04,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:04,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:04,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:04,584 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:04,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:04,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:04,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:04,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:04,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:04,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:04,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:04,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:04,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:04,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:04,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:04,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:04,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:04,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:04,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:04,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:04,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:04,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:04,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:04,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:04,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:04,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:04,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:04,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:04,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:04,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:04,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:04,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:04,897 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:04,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 19:04:04,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16cc4e048/de5db400e82943f69da5608afc7110df/FLAG09f5bfa40 [2019-12-18 19:04:05,516 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:05,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 19:04:05,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16cc4e048/de5db400e82943f69da5608afc7110df/FLAG09f5bfa40 [2019-12-18 19:04:05,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16cc4e048/de5db400e82943f69da5608afc7110df [2019-12-18 19:04:05,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:05,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:05,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:05,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:05,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:05,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:05" (1/1) ... [2019-12-18 19:04:05,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:05, skipping insertion in model container [2019-12-18 19:04:05,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:05" (1/1) ... [2019-12-18 19:04:05,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:05,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:06,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:06,421 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:06,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:06,563 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:06,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06 WrapperNode [2019-12-18 19:04:06,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:06,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:06,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:06,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:06,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:06,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:06,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:06,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:06,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (1/1) ... [2019-12-18 19:04:06,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:06,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:06,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:06,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:06,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (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 19:04:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:06,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:06,735 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 19:04:07,442 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:07,442 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:07,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:07 BoogieIcfgContainer [2019-12-18 19:04:07,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:07,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:07,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:07,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:07,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:05" (1/3) ... [2019-12-18 19:04:07,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3998c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:07, skipping insertion in model container [2019-12-18 19:04:07,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:06" (2/3) ... [2019-12-18 19:04:07,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3998c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:07, skipping insertion in model container [2019-12-18 19:04:07,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:07" (3/3) ... [2019-12-18 19:04:07,455 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-18 19:04:07,465 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:07,466 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:07,476 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:07,477 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:07,581 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:04:07,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:07,619 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:07,619 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:07,619 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:07,619 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:07,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:07,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:07,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:07,637 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 19:04:07,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:07,712 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:07,712 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:07,731 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 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:07,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 19:04:07,820 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 19:04:07,820 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:07,827 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 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 19:04:07,843 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 19:04:07,847 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:12,182 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 19:04:12,314 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-18 19:04:12,314 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 19:04:12,318 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 19:04:12,770 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-18 19:04:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-18 19:04:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:04:12,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:12,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:04:12,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:12,787 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-18 19:04:12,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:12,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994788073] [2019-12-18 19:04:12,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:12,982 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 19:04:12,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994788073] [2019-12-18 19:04:12,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:12,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:04:12,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765110570] [2019-12-18 19:04:12,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:12,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:13,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:13,007 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-18 19:04:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:13,230 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-18 19:04:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:04:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:13,318 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 19:04:13,319 INFO L226 Difference]: Without dead ends: 8226 [2019-12-18 19:04:13,320 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 19:04:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-18 19:04:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-18 19:04:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-18 19:04:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-18 19:04:13,799 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-18 19:04:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:13,800 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-18 19:04:13,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-18 19:04:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:13,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:13,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:13,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-18 19:04:13,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:13,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325625376] [2019-12-18 19:04:13,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:13,952 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 19:04:13,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325625376] [2019-12-18 19:04:13,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:13,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:13,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449363362] [2019-12-18 19:04:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:13,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:13,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:13,957 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-18 19:04:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:14,417 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-18 19:04:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:14,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:14,514 INFO L225 Difference]: With dead ends: 12778 [2019-12-18 19:04:14,515 INFO L226 Difference]: Without dead ends: 12771 [2019-12-18 19:04:14,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-18 19:04:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-18 19:04:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-18 19:04:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-18 19:04:15,485 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-18 19:04:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:15,485 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-18 19:04:15,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-18 19:04:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:04:15,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:15,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:04:15,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-18 19:04:15,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335500135] [2019-12-18 19:04:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:15,579 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 19:04:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335500135] [2019-12-18 19:04:15,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:15,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670002567] [2019-12-18 19:04:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:04:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:04:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:04:15,582 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-18 19:04:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:15,633 INFO L93 Difference]: Finished difference Result 1910 states and 4431 transitions. [2019-12-18 19:04:15,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:04:15,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:04:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:15,639 INFO L225 Difference]: With dead ends: 1910 [2019-12-18 19:04:15,639 INFO L226 Difference]: Without dead ends: 1633 [2019-12-18 19:04:15,639 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 19:04:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-12-18 19:04:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2019-12-18 19:04:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-12-18 19:04:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3665 transitions. [2019-12-18 19:04:15,679 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3665 transitions. Word has length 11 [2019-12-18 19:04:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:15,680 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 3665 transitions. [2019-12-18 19:04:15,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:04:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3665 transitions. [2019-12-18 19:04:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:04:15,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:15,690 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] [2019-12-18 19:04:15,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1924498971, now seen corresponding path program 1 times [2019-12-18 19:04:15,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:15,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338454054] [2019-12-18 19:04:15,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:15,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338454054] [2019-12-18 19:04:15,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:15,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:15,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954507758] [2019-12-18 19:04:15,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:04:16,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:04:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:16,004 INFO L87 Difference]: Start difference. First operand 1633 states and 3665 transitions. Second operand 7 states. [2019-12-18 19:04:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:16,403 INFO L93 Difference]: Finished difference Result 2064 states and 4529 transitions. [2019-12-18 19:04:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:04:16,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:04:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:16,408 INFO L225 Difference]: With dead ends: 2064 [2019-12-18 19:04:16,409 INFO L226 Difference]: Without dead ends: 2064 [2019-12-18 19:04:16,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-18 19:04:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1847. [2019-12-18 19:04:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-12-18 19:04:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 4101 transitions. [2019-12-18 19:04:16,450 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 4101 transitions. Word has length 23 [2019-12-18 19:04:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:16,450 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 4101 transitions. [2019-12-18 19:04:16,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:04:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 4101 transitions. [2019-12-18 19:04:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:04:16,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:16,454 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 19:04:16,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -918854658, now seen corresponding path program 1 times [2019-12-18 19:04:16,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:16,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040765045] [2019-12-18 19:04:16,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:16,503 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 19:04:16,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040765045] [2019-12-18 19:04:16,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:16,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:04:16,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034925620] [2019-12-18 19:04:16,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:16,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:16,506 INFO L87 Difference]: Start difference. First operand 1847 states and 4101 transitions. Second operand 3 states. [2019-12-18 19:04:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:16,627 INFO L93 Difference]: Finished difference Result 2173 states and 4758 transitions. [2019-12-18 19:04:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:16,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 19:04:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:16,632 INFO L225 Difference]: With dead ends: 2173 [2019-12-18 19:04:16,632 INFO L226 Difference]: Without dead ends: 2173 [2019-12-18 19:04:16,633 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 19:04:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-18 19:04:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1970. [2019-12-18 19:04:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-18 19:04:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-18 19:04:16,677 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 37 [2019-12-18 19:04:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:16,677 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-18 19:04:16,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-18 19:04:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:04:16,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:16,681 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 19:04:16,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-18 19:04:16,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:16,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933725936] [2019-12-18 19:04:16,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:16,960 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 19:04:16,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933725936] [2019-12-18 19:04:16,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:16,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:04:16,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306921819] [2019-12-18 19:04:16,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:04:16,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:04:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:04:16,964 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 9 states. [2019-12-18 19:04:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:17,789 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-18 19:04:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:04:17,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 19:04:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:17,797 INFO L225 Difference]: With dead ends: 2561 [2019-12-18 19:04:17,798 INFO L226 Difference]: Without dead ends: 2559 [2019-12-18 19:04:17,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-18 19:04:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-18 19:04:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-18 19:04:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-18 19:04:17,848 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-18 19:04:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:17,848 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-18 19:04:17,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:04:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-18 19:04:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:04:17,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:17,854 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] [2019-12-18 19:04:17,854 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-18 19:04:17,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:17,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890651] [2019-12-18 19:04:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:17,938 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 19:04:17,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574890651] [2019-12-18 19:04:17,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:17,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:17,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834000346] [2019-12-18 19:04:17,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:17,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:17,941 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-18 19:04:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:18,490 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-18 19:04:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:18,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 19:04:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:18,503 INFO L225 Difference]: With dead ends: 2780 [2019-12-18 19:04:18,503 INFO L226 Difference]: Without dead ends: 2780 [2019-12-18 19:04:18,503 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 19:04:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-18 19:04:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-18 19:04:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 19:04:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-18 19:04:18,556 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-18 19:04:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:18,556 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-18 19:04:18,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-18 19:04:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:18,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:18,562 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] [2019-12-18 19:04:18,562 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-18 19:04:18,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:18,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022019577] [2019-12-18 19:04:18,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:18,636 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 19:04:18,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022019577] [2019-12-18 19:04:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:18,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:18,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020462070] [2019-12-18 19:04:18,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:18,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:18,639 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 3 states. [2019-12-18 19:04:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:18,666 INFO L93 Difference]: Finished difference Result 2372 states and 5134 transitions. [2019-12-18 19:04:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:18,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 19:04:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:18,673 INFO L225 Difference]: With dead ends: 2372 [2019-12-18 19:04:18,673 INFO L226 Difference]: Without dead ends: 2372 [2019-12-18 19:04:18,674 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 19:04:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-12-18 19:04:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2019-12-18 19:04:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-18 19:04:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 5118 transitions. [2019-12-18 19:04:18,715 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 5118 transitions. Word has length 42 [2019-12-18 19:04:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:18,716 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 5118 transitions. [2019-12-18 19:04:18,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 5118 transitions. [2019-12-18 19:04:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 19:04:18,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:18,721 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] [2019-12-18 19:04:18,721 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-18 19:04:18,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:18,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952269829] [2019-12-18 19:04:18,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:18,848 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 19:04:18,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952269829] [2019-12-18 19:04:18,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:18,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:04:18,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442280671] [2019-12-18 19:04:18,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:04:18,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:04:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:04:18,851 INFO L87 Difference]: Start difference. First operand 2364 states and 5118 transitions. Second operand 5 states. [2019-12-18 19:04:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:18,890 INFO L93 Difference]: Finished difference Result 581 states and 1046 transitions. [2019-12-18 19:04:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:04:18,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 19:04:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:18,892 INFO L225 Difference]: With dead ends: 581 [2019-12-18 19:04:18,892 INFO L226 Difference]: Without dead ends: 514 [2019-12-18 19:04:18,893 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 19:04:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-18 19:04:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 425. [2019-12-18 19:04:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-18 19:04:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 753 transitions. [2019-12-18 19:04:18,900 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 753 transitions. Word has length 42 [2019-12-18 19:04:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:18,901 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 753 transitions. [2019-12-18 19:04:18,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:04:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 753 transitions. [2019-12-18 19:04:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:18,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:18,902 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 19:04:18,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 923557156, now seen corresponding path program 1 times [2019-12-18 19:04:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:18,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878918820] [2019-12-18 19:04:18,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:18,979 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 19:04:18,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878918820] [2019-12-18 19:04:18,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:18,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:18,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357469822] [2019-12-18 19:04:18,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:18,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:18,982 INFO L87 Difference]: Start difference. First operand 425 states and 753 transitions. Second operand 6 states. [2019-12-18 19:04:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:19,108 INFO L93 Difference]: Finished difference Result 514 states and 908 transitions. [2019-12-18 19:04:19,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:19,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 19:04:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:19,110 INFO L225 Difference]: With dead ends: 514 [2019-12-18 19:04:19,111 INFO L226 Difference]: Without dead ends: 514 [2019-12-18 19:04:19,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:04:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-18 19:04:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 432. [2019-12-18 19:04:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-18 19:04:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 766 transitions. [2019-12-18 19:04:19,120 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 766 transitions. Word has length 53 [2019-12-18 19:04:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:19,120 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 766 transitions. [2019-12-18 19:04:19,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 766 transitions. [2019-12-18 19:04:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 19:04:19,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:19,122 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 19:04:19,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 2 times [2019-12-18 19:04:19,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:19,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487163231] [2019-12-18 19:04:19,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:04:19,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487163231] [2019-12-18 19:04:19,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:19,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:04:19,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086289332] [2019-12-18 19:04:19,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:04:19,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:04:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:04:19,203 INFO L87 Difference]: Start difference. First operand 432 states and 766 transitions. Second operand 3 states. [2019-12-18 19:04:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:19,241 INFO L93 Difference]: Finished difference Result 431 states and 764 transitions. [2019-12-18 19:04:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:04:19,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 19:04:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:19,242 INFO L225 Difference]: With dead ends: 431 [2019-12-18 19:04:19,243 INFO L226 Difference]: Without dead ends: 431 [2019-12-18 19:04:19,243 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 19:04:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-18 19:04:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 333. [2019-12-18 19:04:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-18 19:04:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 585 transitions. [2019-12-18 19:04:19,249 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 585 transitions. Word has length 53 [2019-12-18 19:04:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:19,250 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 585 transitions. [2019-12-18 19:04:19,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:04:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 585 transitions. [2019-12-18 19:04:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:19,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:19,251 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 19:04:19,251 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1896622654, now seen corresponding path program 1 times [2019-12-18 19:04:19,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:19,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558302193] [2019-12-18 19:04:19,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:19,389 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 19:04:19,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558302193] [2019-12-18 19:04:19,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:19,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:04:19,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429970983] [2019-12-18 19:04:19,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:04:19,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:19,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:04:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:04:19,391 INFO L87 Difference]: Start difference. First operand 333 states and 585 transitions. Second operand 6 states. [2019-12-18 19:04:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:19,471 INFO L93 Difference]: Finished difference Result 534 states and 940 transitions. [2019-12-18 19:04:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:04:19,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 19:04:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:19,473 INFO L225 Difference]: With dead ends: 534 [2019-12-18 19:04:19,473 INFO L226 Difference]: Without dead ends: 243 [2019-12-18 19:04:19,475 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 19:04:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-18 19:04:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-12-18 19:04:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-18 19:04:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-18 19:04:19,481 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 54 [2019-12-18 19:04:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:19,481 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-18 19:04:19,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:04:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-18 19:04:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:19,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:19,483 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 19:04:19,483 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 2 times [2019-12-18 19:04:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:19,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302876556] [2019-12-18 19:04:19,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:19,757 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 19:04:19,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302876556] [2019-12-18 19:04:19,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:19,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:04:19,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965969489] [2019-12-18 19:04:19,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:04:19,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:04:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:04:19,759 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 13 states. [2019-12-18 19:04:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:20,353 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-18 19:04:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 19:04:20,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 19:04:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:20,355 INFO L225 Difference]: With dead ends: 384 [2019-12-18 19:04:20,355 INFO L226 Difference]: Without dead ends: 353 [2019-12-18 19:04:20,356 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 19:04:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-18 19:04:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-18 19:04:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 19:04:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-18 19:04:20,362 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-18 19:04:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:20,362 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-18 19:04:20,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:04:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-18 19:04:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:20,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:20,364 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 19:04:20,364 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 3 times [2019-12-18 19:04:20,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:20,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813799716] [2019-12-18 19:04:20,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:04:20,588 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 19:04:20,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813799716] [2019-12-18 19:04:20,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:04:20,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:04:20,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517189833] [2019-12-18 19:04:20,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:04:20,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:04:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:04:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:04:20,590 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 14 states. [2019-12-18 19:04:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:04:21,112 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-18 19:04:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:04:21,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 19:04:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:04:21,114 INFO L225 Difference]: With dead ends: 420 [2019-12-18 19:04:21,114 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 19:04:21,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:04:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 19:04:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-18 19:04:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 19:04:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-18 19:04:21,121 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-18 19:04:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:04:21,122 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-18 19:04:21,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:04:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-18 19:04:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 19:04:21,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:04:21,123 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 19:04:21,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:04:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:04:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 4 times [2019-12-18 19:04:21,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:04:21,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187088092] [2019-12-18 19:04:21,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:04:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:04:21,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:04:21,236 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:04:21,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:21,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-18 19:04:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:04:21,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2120142901 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2120142901 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2120142901|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2120142901 |P0Thread1of1ForFork0_#t~ite5_Out-2120142901|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120142901, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120142901} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2120142901|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120142901, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120142901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 19:04:21,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-840744403 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-840744403 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-840744403| ~y$w_buff1~0_In-840744403)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-840744403| ~y~0_In-840744403) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-840744403, ~y$w_buff1~0=~y$w_buff1~0_In-840744403, ~y~0=~y~0_In-840744403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840744403} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-840744403, ~y$w_buff1~0=~y$w_buff1~0_In-840744403, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-840744403|, ~y~0=~y~0_In-840744403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840744403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 19:04:21,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 19:04:21,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In433490908 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In433490908 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out433490908|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In433490908 |P1Thread1of1ForFork1_#t~ite11_Out433490908|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In433490908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In433490908} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In433490908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In433490908, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out433490908|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 19:04:21,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-310628389 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-310628389 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-310628389 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-310628389 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-310628389| 0)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-310628389 |P0Thread1of1ForFork0_#t~ite6_Out-310628389|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-310628389, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-310628389, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-310628389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-310628389} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-310628389|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-310628389, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-310628389, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-310628389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-310628389} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 19:04:21,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1885281489 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1885281489 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1885281489) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1885281489 ~y$r_buff0_thd1~0_Out-1885281489)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885281489, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1885281489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885281489, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1885281489|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1885281489} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:04:21,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In2137120373 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2137120373 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2137120373 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2137120373 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out2137120373| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out2137120373| ~y$w_buff1_used~0_In2137120373)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2137120373, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2137120373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2137120373, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2137120373} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2137120373, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2137120373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2137120373, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2137120373|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2137120373} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 19:04:21,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1745349559 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1745349559 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1745349559| ~y$r_buff0_thd2~0_In-1745349559)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1745349559| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745349559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1745349559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745349559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1745349559, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1745349559|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 19:04:21,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1961437080 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1961437080 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1961437080 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1961437080 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1961437080| ~y$r_buff1_thd2~0_In1961437080) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1961437080|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1961437080, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1961437080, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1961437080, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1961437080} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1961437080, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1961437080, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1961437080, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1961437080|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1961437080} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:04:21,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:04:21,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In668168274 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In668168274 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In668168274 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In668168274 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out668168274| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out668168274| ~y$r_buff1_thd1~0_In668168274)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In668168274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In668168274, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In668168274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In668168274} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In668168274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In668168274, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out668168274|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In668168274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In668168274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 19:04:21,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 19:04:21,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:04:21,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-636586282 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-636586282 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-636586282| ~y$w_buff1~0_In-636586282) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-636586282| ~y~0_In-636586282)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-636586282, ~y~0=~y~0_In-636586282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-636586282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636586282} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-636586282|, ~y$w_buff1~0=~y$w_buff1~0_In-636586282, ~y~0=~y~0_In-636586282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-636586282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636586282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 19:04:21,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |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|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 19:04:21,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-372666499 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-372666499 256) 0))) (or (and (= ~y$w_buff0_used~0_In-372666499 |ULTIMATE.start_main_#t~ite19_Out-372666499|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-372666499|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-372666499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-372666499} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-372666499, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-372666499|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-372666499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:04:21,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In375809185 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In375809185 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In375809185 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In375809185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out375809185|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out375809185| ~y$w_buff1_used~0_In375809185) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In375809185, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375809185, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In375809185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In375809185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In375809185, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375809185, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out375809185|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In375809185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In375809185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:04:21,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1115409787 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1115409787 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1115409787 |ULTIMATE.start_main_#t~ite21_Out-1115409787|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1115409787|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1115409787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1115409787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1115409787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1115409787, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1115409787|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:04:21,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1654896761 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1654896761 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1654896761 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1654896761 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1654896761 |ULTIMATE.start_main_#t~ite22_Out-1654896761|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1654896761|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654896761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1654896761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1654896761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654896761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654896761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1654896761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1654896761, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1654896761|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654896761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:04:21,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In277798354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out277798354| ~y$w_buff0_used~0_In277798354) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In277798354 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In277798354 256))) (= (mod ~y$w_buff0_used~0_In277798354 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In277798354 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite35_Out277798354| |ULTIMATE.start_main_#t~ite34_Out277798354|) .cse1) (and (= |ULTIMATE.start_main_#t~ite35_Out277798354| ~y$w_buff0_used~0_In277798354) (= |ULTIMATE.start_main_#t~ite34_In277798354| |ULTIMATE.start_main_#t~ite34_Out277798354|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In277798354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In277798354, ~weak$$choice2~0=~weak$$choice2~0_In277798354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In277798354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277798354, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In277798354|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In277798354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In277798354, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out277798354|, ~weak$$choice2~0=~weak$$choice2~0_In277798354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In277798354, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out277798354|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277798354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 19:04:21,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 19:04:21,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:04:21,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:04:21,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:04:21 BasicIcfg [2019-12-18 19:04:21,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:04:21,360 INFO L168 Benchmark]: Toolchain (without parser) took 15555.36 ms. Allocated memory was 139.5 MB in the beginning and 548.4 MB in the end (delta: 408.9 MB). Free memory was 102.7 MB in the beginning and 211.0 MB in the end (delta: -108.3 MB). Peak memory consumption was 300.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,361 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.77 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 156.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,366 INFO L168 Benchmark]: Boogie Preprocessor took 38.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,367 INFO L168 Benchmark]: RCFGBuilder took 771.40 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,367 INFO L168 Benchmark]: TraceAbstraction took 13913.21 ms. Allocated memory was 203.4 MB in the beginning and 548.4 MB in the end (delta: 345.0 MB). Free memory was 106.7 MB in the beginning and 211.0 MB in the end (delta: -104.3 MB). Peak memory consumption was 240.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:04:21,377 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.77 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 156.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.54 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 771.40 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13913.21 ms. Allocated memory was 203.4 MB in the beginning and 548.4 MB in the end (delta: 345.0 MB). Free memory was 106.7 MB in the beginning and 211.0 MB in the end (delta: -104.3 MB). Peak memory consumption was 240.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 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(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1714 SDtfs, 1535 SDslu, 4268 SDs, 0 SdLazy, 2550 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11467occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2986 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 93780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...