/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:25:05,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:25:05,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:25:05,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:25:05,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:25:05,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:25:05,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:25:05,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:25:05,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:25:05,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:25:05,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:25:05,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:25:05,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:25:05,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:25:05,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:25:05,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:25:05,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:25:05,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:25:05,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:25:05,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:25:05,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:25:05,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:25:05,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:25:05,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:25:05,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:25:05,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:25:05,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:25:05,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:25:05,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:25:05,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:25:05,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:25:05,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:25:05,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:25:05,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:25:05,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:25:05,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:25:05,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:25:05,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:25:05,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:25:05,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:25:05,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:25:05,542 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-MCR.epf [2019-12-27 16:25:05,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:25:05,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:25:05,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:25:05,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:25:05,559 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:25:05,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:25:05,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:25:05,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:25:05,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:25:05,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:25:05,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:25:05,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:25:05,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:25:05,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:25:05,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:25:05,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:25:05,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:25:05,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:25:05,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:25:05,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:25:05,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:25:05,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:25:05,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:25:05,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:25:05,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:25:05,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:25:05,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:25:05,563 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:25:05,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:25:05,564 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:25:05,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:25:05,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:25:05,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:25:05,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:25:05,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:25:05,896 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:25:05,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 16:25:05,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4544ee7/2d908b9865ed432183b54a55f8066d39/FLAG702942142 [2019-12-27 16:25:06,506 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:25:06,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 16:25:06,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4544ee7/2d908b9865ed432183b54a55f8066d39/FLAG702942142 [2019-12-27 16:25:06,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4544ee7/2d908b9865ed432183b54a55f8066d39 [2019-12-27 16:25:06,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:25:06,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:25:06,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:25:06,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:25:06,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:25:06,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:25:06" (1/1) ... [2019-12-27 16:25:06,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b0a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:06, skipping insertion in model container [2019-12-27 16:25:06,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:25:06" (1/1) ... [2019-12-27 16:25:06,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:25:06,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:25:07,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:25:07,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:25:07,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:25:07,645 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:25:07,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07 WrapperNode [2019-12-27 16:25:07,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:25:07,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:25:07,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:25:07,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:25:07,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:25:07,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:25:07,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:25:07,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:25:07,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (1/1) ... [2019-12-27 16:25:07,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:25:07,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:25:07,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:25:07,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:25:07,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (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-27 16:25:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:25:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:25:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:25:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:25:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:25:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:25:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:25:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:25:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:25:07,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:25:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:25:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:25:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:25:07,854 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:25:08,646 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:25:08,647 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:25:08,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:25:08 BoogieIcfgContainer [2019-12-27 16:25:08,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:25:08,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:25:08,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:25:08,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:25:08,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:25:06" (1/3) ... [2019-12-27 16:25:08,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6590f881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:25:08, skipping insertion in model container [2019-12-27 16:25:08,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:07" (2/3) ... [2019-12-27 16:25:08,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6590f881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:25:08, skipping insertion in model container [2019-12-27 16:25:08,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:25:08" (3/3) ... [2019-12-27 16:25:08,657 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.opt.i [2019-12-27 16:25:08,667 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:25:08,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:25:08,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:25:08,678 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:25:08,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,782 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,784 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,792 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:08,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:25:08,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:25:08,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:25:08,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:25:08,836 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:25:08,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:25:08,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:25:08,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:25:08,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:25:08,853 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 16:25:08,855 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:25:08,956 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:25:08,957 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:25:08,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:25:09,001 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:25:09,062 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:25:09,062 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:25:09,072 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:25:09,097 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:25:09,098 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:25:14,543 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:25:14,675 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:25:14,978 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 16:25:14,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 16:25:14,984 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 16:25:36,830 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 16:25:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 16:25:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:25:36,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:36,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:25:36,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 16:25:36,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:36,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304130489] [2019-12-27 16:25:36,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:37,098 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-27 16:25:37,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304130489] [2019-12-27 16:25:37,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:37,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:25:37,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704307338] [2019-12-27 16:25:37,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:37,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:37,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:25:37,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:37,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:37,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:37,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:37,136 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 16:25:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:41,013 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 16:25:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:41,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:25:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:41,650 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 16:25:41,650 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 16:25:41,652 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-27 16:25:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 16:25:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 16:25:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 16:25:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 16:25:51,431 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 16:25:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:51,432 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 16:25:51,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 16:25:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:25:51,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:51,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:51,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 16:25:51,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:51,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544696133] [2019-12-27 16:25:51,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:51,562 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-27 16:25:51,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544696133] [2019-12-27 16:25:51,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:51,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:51,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447845614] [2019-12-27 16:25:51,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:51,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:51,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:25:51,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:51,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:51,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:25:51,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:25:51,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:25:51,573 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 16:25:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:56,361 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 16:25:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:56,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:25:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:57,094 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 16:25:57,094 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 16:25:57,097 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-27 16:26:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 16:26:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 16:26:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 16:26:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 16:26:10,901 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 16:26:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:10,902 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 16:26:10,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 16:26:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:26:10,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:10,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:10,910 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 16:26:10,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:10,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341425428] [2019-12-27 16:26:10,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:10,961 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-27 16:26:10,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341425428] [2019-12-27 16:26:10,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:10,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:10,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050271645] [2019-12-27 16:26:10,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:10,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:10,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:26:10,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:10,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:10,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:10,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:10,974 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 16:26:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:11,122 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 16:26:11,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:11,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:26:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:11,173 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 16:26:11,174 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 16:26:11,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 16:26:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 16:26:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 16:26:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 16:26:16,524 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 16:26:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:16,525 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 16:26:16,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 16:26:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:16,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:16,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:16,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 16:26:16,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:16,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526475786] [2019-12-27 16:26:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:16,580 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-27 16:26:16,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526475786] [2019-12-27 16:26:16,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:16,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:16,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1432766951] [2019-12-27 16:26:16,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:16,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:16,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:16,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:16,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:16,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:16,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:16,589 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 16:26:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:16,823 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 16:26:16,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:16,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:26:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:16,919 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 16:26:16,920 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 16:26:16,920 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-27 16:26:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 16:26:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 16:26:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 16:26:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 16:26:18,225 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 16:26:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:18,226 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 16:26:18,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 16:26:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:18,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:18,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:18,229 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 16:26:18,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:18,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577878381] [2019-12-27 16:26:18,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:18,359 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-27 16:26:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577878381] [2019-12-27 16:26:18,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:18,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:18,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727836121] [2019-12-27 16:26:18,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:18,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:18,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:18,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:18,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:18,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:18,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:18,367 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 16:26:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:18,758 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 16:26:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:18,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:26:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:18,838 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 16:26:18,838 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 16:26:18,838 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-27 16:26:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 16:26:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 16:26:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:26:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 16:26:19,627 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 16:26:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:19,627 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 16:26:19,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 16:26:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:19,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:19,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:19,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 16:26:19,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:19,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847120016] [2019-12-27 16:26:19,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:19,696 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-27 16:26:19,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847120016] [2019-12-27 16:26:19,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:19,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:19,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667424269] [2019-12-27 16:26:19,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:19,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:19,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:19,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:19,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:19,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:19,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:19,703 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 16:26:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:20,065 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 16:26:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:20,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:26:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:20,152 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 16:26:20,153 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 16:26:20,153 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-27 16:26:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 16:26:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 16:26:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 16:26:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 16:26:21,439 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 16:26:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:21,439 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 16:26:21,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 16:26:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:26:21,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:21,450 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] [2019-12-27 16:26:21,450 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 16:26:21,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:21,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984447599] [2019-12-27 16:26:21,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:21,529 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-27 16:26:21,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984447599] [2019-12-27 16:26:21,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:21,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:21,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515318573] [2019-12-27 16:26:21,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:21,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:21,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:26:21,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:21,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:21,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:21,549 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 16:26:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:22,212 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 16:26:22,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:26:22,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:26:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:22,310 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 16:26:22,310 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 16:26:22,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 16:26:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 16:26:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 16:26:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 16:26:23,182 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 16:26:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:23,182 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 16:26:23,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 16:26:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:26:23,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:23,191 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] [2019-12-27 16:26:23,192 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 16:26:23,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:23,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36170924] [2019-12-27 16:26:23,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:23,258 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-27 16:26:23,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36170924] [2019-12-27 16:26:23,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:23,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:23,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060893974] [2019-12-27 16:26:23,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:23,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:23,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:26:23,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:23,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:23,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:23,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:23,272 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 16:26:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:24,270 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 16:26:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:26:24,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:26:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:24,377 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 16:26:24,377 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 16:26:24,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 16:26:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 16:26:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 16:26:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 16:26:25,306 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 16:26:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:25,306 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 16:26:25,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 16:26:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:26:25,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:25,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:25,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 16:26:25,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:25,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327352288] [2019-12-27 16:26:25,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:25,363 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-27 16:26:25,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327352288] [2019-12-27 16:26:25,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:25,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:25,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532237989] [2019-12-27 16:26:25,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:25,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:25,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:26:25,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:25,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:26:25,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:25,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:25,430 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 5 states. [2019-12-27 16:26:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:25,539 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 16:26:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:26:25,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:26:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:25,566 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 16:26:25,566 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 16:26:25,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 16:26:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 16:26:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 16:26:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 16:26:25,816 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 16:26:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:25,816 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 16:26:25,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 16:26:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:26:25,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:25,828 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] [2019-12-27 16:26:25,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 16:26:25,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:25,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697050492] [2019-12-27 16:26:25,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:25,906 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-27 16:26:25,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697050492] [2019-12-27 16:26:25,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:25,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:25,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522644702] [2019-12-27 16:26:25,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:25,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:25,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:26:25,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:25,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:25,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:25,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:25,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:25,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:25,922 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 16:26:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:26,300 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 16:26:26,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:26,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:26:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:26,340 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 16:26:26,340 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 16:26:26,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 16:26:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 16:26:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 16:26:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 16:26:26,894 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 16:26:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:26,895 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 16:26:26,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 16:26:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:26:26,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:26,910 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] [2019-12-27 16:26:26,910 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 16:26:26,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:26,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105358880] [2019-12-27 16:26:26,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:26,976 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-27 16:26:26,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105358880] [2019-12-27 16:26:26,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:26,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:26,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [809311404] [2019-12-27 16:26:26,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:26,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:26,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:26:26,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:26,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:26,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:26,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:26,990 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 16:26:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:27,298 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 16:26:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:27,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:26:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:27,331 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 16:26:27,331 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 16:26:27,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 16:26:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 16:26:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 16:26:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 16:26:27,641 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 16:26:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:27,642 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 16:26:27,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 16:26:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:26:27,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:27,660 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] [2019-12-27 16:26:27,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 16:26:27,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:27,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945974910] [2019-12-27 16:26:27,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:27,810 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-27 16:26:27,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945974910] [2019-12-27 16:26:27,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:27,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:27,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742761614] [2019-12-27 16:26:27,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:27,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:27,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 16:26:27,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:27,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:27,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:27,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:27,841 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 7 states. [2019-12-27 16:26:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:28,631 INFO L93 Difference]: Finished difference Result 28860 states and 86218 transitions. [2019-12-27 16:26:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:26:28,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 16:26:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:28,681 INFO L225 Difference]: With dead ends: 28860 [2019-12-27 16:26:28,681 INFO L226 Difference]: Without dead ends: 28860 [2019-12-27 16:26:28,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:26:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28860 states. [2019-12-27 16:26:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28860 to 21822. [2019-12-27 16:26:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21822 states. [2019-12-27 16:26:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21822 states to 21822 states and 66391 transitions. [2019-12-27 16:26:29,058 INFO L78 Accepts]: Start accepts. Automaton has 21822 states and 66391 transitions. Word has length 32 [2019-12-27 16:26:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:29,059 INFO L462 AbstractCegarLoop]: Abstraction has 21822 states and 66391 transitions. [2019-12-27 16:26:29,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21822 states and 66391 transitions. [2019-12-27 16:26:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:26:29,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:29,086 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] [2019-12-27 16:26:29,087 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 16:26:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:29,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083698463] [2019-12-27 16:26:29,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:29,197 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-27 16:26:29,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083698463] [2019-12-27 16:26:29,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:29,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:29,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247873404] [2019-12-27 16:26:29,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:29,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:29,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 94 transitions. [2019-12-27 16:26:29,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:29,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:29,233 INFO L87 Difference]: Start difference. First operand 21822 states and 66391 transitions. Second operand 6 states. [2019-12-27 16:26:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:29,932 INFO L93 Difference]: Finished difference Result 29045 states and 86925 transitions. [2019-12-27 16:26:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:26:29,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 16:26:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:29,972 INFO L225 Difference]: With dead ends: 29045 [2019-12-27 16:26:29,972 INFO L226 Difference]: Without dead ends: 29045 [2019-12-27 16:26:29,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:26:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29045 states. [2019-12-27 16:26:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29045 to 21326. [2019-12-27 16:26:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21326 states. [2019-12-27 16:26:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21326 states to 21326 states and 65148 transitions. [2019-12-27 16:26:30,634 INFO L78 Accepts]: Start accepts. Automaton has 21326 states and 65148 transitions. Word has length 34 [2019-12-27 16:26:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:30,634 INFO L462 AbstractCegarLoop]: Abstraction has 21326 states and 65148 transitions. [2019-12-27 16:26:30,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21326 states and 65148 transitions. [2019-12-27 16:26:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 16:26:30,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:30,655 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] [2019-12-27 16:26:30,655 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -294288994, now seen corresponding path program 1 times [2019-12-27 16:26:30,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:30,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161097600] [2019-12-27 16:26:30,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:30,748 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-27 16:26:30,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161097600] [2019-12-27 16:26:30,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:30,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:30,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187318289] [2019-12-27 16:26:30,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:30,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:30,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 134 transitions. [2019-12-27 16:26:30,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:30,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:26:30,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:26:30,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:26:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:26:30,921 INFO L87 Difference]: Start difference. First operand 21326 states and 65148 transitions. Second operand 11 states. [2019-12-27 16:26:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:32,897 INFO L93 Difference]: Finished difference Result 40636 states and 120000 transitions. [2019-12-27 16:26:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:26:32,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-12-27 16:26:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:32,962 INFO L225 Difference]: With dead ends: 40636 [2019-12-27 16:26:32,962 INFO L226 Difference]: Without dead ends: 40636 [2019-12-27 16:26:32,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:26:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40636 states. [2019-12-27 16:26:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40636 to 18096. [2019-12-27 16:26:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18096 states. [2019-12-27 16:26:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18096 states to 18096 states and 55338 transitions. [2019-12-27 16:26:33,381 INFO L78 Accepts]: Start accepts. Automaton has 18096 states and 55338 transitions. Word has length 36 [2019-12-27 16:26:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:33,382 INFO L462 AbstractCegarLoop]: Abstraction has 18096 states and 55338 transitions. [2019-12-27 16:26:33,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:26:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18096 states and 55338 transitions. [2019-12-27 16:26:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:26:33,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:33,401 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] [2019-12-27 16:26:33,401 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 16:26:33,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:33,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327696135] [2019-12-27 16:26:33,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:33,457 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-27 16:26:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327696135] [2019-12-27 16:26:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:26:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774740107] [2019-12-27 16:26:33,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:33,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:33,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 16:26:33,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:33,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:33,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:33,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:33,535 INFO L87 Difference]: Start difference. First operand 18096 states and 55338 transitions. Second operand 3 states. [2019-12-27 16:26:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:33,624 INFO L93 Difference]: Finished difference Result 18095 states and 55336 transitions. [2019-12-27 16:26:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:33,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:26:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:33,660 INFO L225 Difference]: With dead ends: 18095 [2019-12-27 16:26:33,661 INFO L226 Difference]: Without dead ends: 18095 [2019-12-27 16:26:33,661 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-27 16:26:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-27 16:26:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 18095. [2019-12-27 16:26:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18095 states. [2019-12-27 16:26:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18095 states to 18095 states and 55336 transitions. [2019-12-27 16:26:33,959 INFO L78 Accepts]: Start accepts. Automaton has 18095 states and 55336 transitions. Word has length 39 [2019-12-27 16:26:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:33,959 INFO L462 AbstractCegarLoop]: Abstraction has 18095 states and 55336 transitions. [2019-12-27 16:26:33,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18095 states and 55336 transitions. [2019-12-27 16:26:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:26:33,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:33,983 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] [2019-12-27 16:26:33,983 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 16:26:33,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:33,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694616271] [2019-12-27 16:26:33,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:34,055 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-27 16:26:34,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694616271] [2019-12-27 16:26:34,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:34,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:34,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517195534] [2019-12-27 16:26:34,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:34,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:34,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 16:26:34,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:34,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:34,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:34,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:34,235 INFO L87 Difference]: Start difference. First operand 18095 states and 55336 transitions. Second operand 7 states. [2019-12-27 16:26:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:35,166 INFO L93 Difference]: Finished difference Result 25942 states and 78448 transitions. [2019-12-27 16:26:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:26:35,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:26:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:35,216 INFO L225 Difference]: With dead ends: 25942 [2019-12-27 16:26:35,216 INFO L226 Difference]: Without dead ends: 25942 [2019-12-27 16:26:35,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25942 states. [2019-12-27 16:26:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25942 to 24065. [2019-12-27 16:26:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24065 states. [2019-12-27 16:26:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24065 states to 24065 states and 73290 transitions. [2019-12-27 16:26:35,584 INFO L78 Accepts]: Start accepts. Automaton has 24065 states and 73290 transitions. Word has length 40 [2019-12-27 16:26:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:35,584 INFO L462 AbstractCegarLoop]: Abstraction has 24065 states and 73290 transitions. [2019-12-27 16:26:35,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 24065 states and 73290 transitions. [2019-12-27 16:26:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:26:35,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:35,617 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] [2019-12-27 16:26:35,618 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 16:26:35,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:35,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268517346] [2019-12-27 16:26:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:35,679 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-27 16:26:35,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268517346] [2019-12-27 16:26:35,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:35,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:35,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521857096] [2019-12-27 16:26:35,680 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:35,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:35,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:26:35,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:35,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:35,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:35,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:35,791 INFO L87 Difference]: Start difference. First operand 24065 states and 73290 transitions. Second operand 7 states. [2019-12-27 16:26:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:35,907 INFO L93 Difference]: Finished difference Result 22678 states and 70049 transitions. [2019-12-27 16:26:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:35,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:26:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:35,939 INFO L225 Difference]: With dead ends: 22678 [2019-12-27 16:26:35,940 INFO L226 Difference]: Without dead ends: 22678 [2019-12-27 16:26:35,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22678 states. [2019-12-27 16:26:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22678 to 21670. [2019-12-27 16:26:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21670 states. [2019-12-27 16:26:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21670 states to 21670 states and 67330 transitions. [2019-12-27 16:26:36,287 INFO L78 Accepts]: Start accepts. Automaton has 21670 states and 67330 transitions. Word has length 40 [2019-12-27 16:26:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:36,287 INFO L462 AbstractCegarLoop]: Abstraction has 21670 states and 67330 transitions. [2019-12-27 16:26:36,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 21670 states and 67330 transitions. [2019-12-27 16:26:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:36,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:36,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:36,314 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1075216741, now seen corresponding path program 1 times [2019-12-27 16:26:36,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:36,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695374565] [2019-12-27 16:26:36,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:36,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695374565] [2019-12-27 16:26:36,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:36,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:36,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170034970] [2019-12-27 16:26:36,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:36,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:36,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 510 transitions. [2019-12-27 16:26:36,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:36,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:26:36,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:36,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:36,710 INFO L87 Difference]: Start difference. First operand 21670 states and 67330 transitions. Second operand 7 states. [2019-12-27 16:26:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:37,275 INFO L93 Difference]: Finished difference Result 64763 states and 199338 transitions. [2019-12-27 16:26:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:26:37,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:26:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:37,346 INFO L225 Difference]: With dead ends: 64763 [2019-12-27 16:26:37,346 INFO L226 Difference]: Without dead ends: 49560 [2019-12-27 16:26:37,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:26:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49560 states. [2019-12-27 16:26:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49560 to 25103. [2019-12-27 16:26:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25103 states. [2019-12-27 16:26:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25103 states to 25103 states and 78471 transitions. [2019-12-27 16:26:38,251 INFO L78 Accepts]: Start accepts. Automaton has 25103 states and 78471 transitions. Word has length 63 [2019-12-27 16:26:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:38,252 INFO L462 AbstractCegarLoop]: Abstraction has 25103 states and 78471 transitions. [2019-12-27 16:26:38,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states and 78471 transitions. [2019-12-27 16:26:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:38,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:38,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:38,278 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1673226095, now seen corresponding path program 2 times [2019-12-27 16:26:38,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:38,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11831472] [2019-12-27 16:26:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:38,357 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-27 16:26:38,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11831472] [2019-12-27 16:26:38,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:38,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:38,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438142098] [2019-12-27 16:26:38,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:38,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:38,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 290 states and 535 transitions. [2019-12-27 16:26:38,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:38,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:38,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:38,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:38,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:38,780 INFO L87 Difference]: Start difference. First operand 25103 states and 78471 transitions. Second operand 9 states. [2019-12-27 16:26:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:40,898 INFO L93 Difference]: Finished difference Result 82536 states and 253957 transitions. [2019-12-27 16:26:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:40,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:26:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:40,996 INFO L225 Difference]: With dead ends: 82536 [2019-12-27 16:26:40,997 INFO L226 Difference]: Without dead ends: 61546 [2019-12-27 16:26:40,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:26:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61546 states. [2019-12-27 16:26:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61546 to 28968. [2019-12-27 16:26:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28968 states. [2019-12-27 16:26:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28968 states to 28968 states and 90209 transitions. [2019-12-27 16:26:42,195 INFO L78 Accepts]: Start accepts. Automaton has 28968 states and 90209 transitions. Word has length 63 [2019-12-27 16:26:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:42,196 INFO L462 AbstractCegarLoop]: Abstraction has 28968 states and 90209 transitions. [2019-12-27 16:26:42,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 28968 states and 90209 transitions. [2019-12-27 16:26:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:42,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:42,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:42,226 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1413238403, now seen corresponding path program 3 times [2019-12-27 16:26:42,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:42,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353542675] [2019-12-27 16:26:42,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:42,314 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-27 16:26:42,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353542675] [2019-12-27 16:26:42,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:42,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:42,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037975231] [2019-12-27 16:26:42,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:42,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:42,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 432 transitions. [2019-12-27 16:26:42,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:42,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:26:42,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:26:42,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:26:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:42,642 INFO L87 Difference]: Start difference. First operand 28968 states and 90209 transitions. Second operand 8 states. [2019-12-27 16:26:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:44,153 INFO L93 Difference]: Finished difference Result 84506 states and 256954 transitions. [2019-12-27 16:26:44,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:26:44,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 16:26:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:44,261 INFO L225 Difference]: With dead ends: 84506 [2019-12-27 16:26:44,261 INFO L226 Difference]: Without dead ends: 74195 [2019-12-27 16:26:44,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:26:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74195 states. [2019-12-27 16:26:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74195 to 29276. [2019-12-27 16:26:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29276 states. [2019-12-27 16:26:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29276 states to 29276 states and 91160 transitions. [2019-12-27 16:26:45,089 INFO L78 Accepts]: Start accepts. Automaton has 29276 states and 91160 transitions. Word has length 63 [2019-12-27 16:26:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:45,089 INFO L462 AbstractCegarLoop]: Abstraction has 29276 states and 91160 transitions. [2019-12-27 16:26:45,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:26:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29276 states and 91160 transitions. [2019-12-27 16:26:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:45,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:45,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:45,120 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 16:26:45,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:45,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829236206] [2019-12-27 16:26:45,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:45,217 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-27 16:26:45,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829236206] [2019-12-27 16:26:45,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:45,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:45,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825846037] [2019-12-27 16:26:45,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:45,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:45,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 403 transitions. [2019-12-27 16:26:45,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:45,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:26:45,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:45,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:45,921 INFO L87 Difference]: Start difference. First operand 29276 states and 91160 transitions. Second operand 7 states. [2019-12-27 16:26:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:46,955 INFO L93 Difference]: Finished difference Result 37866 states and 115568 transitions. [2019-12-27 16:26:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:26:46,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:26:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:47,009 INFO L225 Difference]: With dead ends: 37866 [2019-12-27 16:26:47,009 INFO L226 Difference]: Without dead ends: 37642 [2019-12-27 16:26:47,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:26:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2019-12-27 16:26:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 31827. [2019-12-27 16:26:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31827 states. [2019-12-27 16:26:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31827 states to 31827 states and 98705 transitions. [2019-12-27 16:26:47,536 INFO L78 Accepts]: Start accepts. Automaton has 31827 states and 98705 transitions. Word has length 63 [2019-12-27 16:26:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:47,536 INFO L462 AbstractCegarLoop]: Abstraction has 31827 states and 98705 transitions. [2019-12-27 16:26:47,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31827 states and 98705 transitions. [2019-12-27 16:26:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:47,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:47,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:47,574 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 16:26:47,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:47,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868028759] [2019-12-27 16:26:47,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:47,706 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-27 16:26:47,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868028759] [2019-12-27 16:26:47,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:47,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:26:47,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708471562] [2019-12-27 16:26:47,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:47,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:47,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 357 transitions. [2019-12-27 16:26:47,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:48,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:26:48,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:26:48,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:26:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:26:48,018 INFO L87 Difference]: Start difference. First operand 31827 states and 98705 transitions. Second operand 12 states. [2019-12-27 16:26:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:52,104 INFO L93 Difference]: Finished difference Result 87245 states and 263602 transitions. [2019-12-27 16:26:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 16:26:52,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-27 16:26:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:52,238 INFO L225 Difference]: With dead ends: 87245 [2019-12-27 16:26:52,238 INFO L226 Difference]: Without dead ends: 86956 [2019-12-27 16:26:52,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 16:26:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86956 states. [2019-12-27 16:26:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86956 to 36490. [2019-12-27 16:26:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36490 states. [2019-12-27 16:26:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36490 states to 36490 states and 112847 transitions. [2019-12-27 16:26:53,201 INFO L78 Accepts]: Start accepts. Automaton has 36490 states and 112847 transitions. Word has length 63 [2019-12-27 16:26:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:53,202 INFO L462 AbstractCegarLoop]: Abstraction has 36490 states and 112847 transitions. [2019-12-27 16:26:53,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:26:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 36490 states and 112847 transitions. [2019-12-27 16:26:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:53,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:53,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:53,239 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-27 16:26:53,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:53,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114410639] [2019-12-27 16:26:53,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:53,363 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-27 16:26:53,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114410639] [2019-12-27 16:26:53,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:53,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:53,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080123770] [2019-12-27 16:26:53,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:53,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:53,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 398 transitions. [2019-12-27 16:26:53,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:53,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:26:53,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:26:53,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:26:53,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:26:53,661 INFO L87 Difference]: Start difference. First operand 36490 states and 112847 transitions. Second operand 11 states. [2019-12-27 16:26:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:56,067 INFO L93 Difference]: Finished difference Result 103991 states and 313937 transitions. [2019-12-27 16:26:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:26:56,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-27 16:26:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:56,236 INFO L225 Difference]: With dead ends: 103991 [2019-12-27 16:26:56,236 INFO L226 Difference]: Without dead ends: 103771 [2019-12-27 16:26:56,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:26:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103771 states. [2019-12-27 16:26:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103771 to 41179. [2019-12-27 16:26:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41179 states. [2019-12-27 16:26:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41179 states to 41179 states and 127397 transitions. [2019-12-27 16:26:57,419 INFO L78 Accepts]: Start accepts. Automaton has 41179 states and 127397 transitions. Word has length 63 [2019-12-27 16:26:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:57,420 INFO L462 AbstractCegarLoop]: Abstraction has 41179 states and 127397 transitions. [2019-12-27 16:26:57,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:26:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 41179 states and 127397 transitions. [2019-12-27 16:26:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:57,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:57,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:57,467 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:57,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-27 16:26:57,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:57,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871757690] [2019-12-27 16:26:57,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:57,573 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-27 16:26:57,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871757690] [2019-12-27 16:26:57,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:57,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:26:57,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470904608] [2019-12-27 16:26:57,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:57,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:57,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 379 transitions. [2019-12-27 16:26:57,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:57,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:26:57,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:26:57,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:26:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:26:57,912 INFO L87 Difference]: Start difference. First operand 41179 states and 127397 transitions. Second operand 12 states. [2019-12-27 16:27:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:01,721 INFO L93 Difference]: Finished difference Result 105754 states and 318783 transitions. [2019-12-27 16:27:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 16:27:01,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-27 16:27:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:01,882 INFO L225 Difference]: With dead ends: 105754 [2019-12-27 16:27:01,882 INFO L226 Difference]: Without dead ends: 105502 [2019-12-27 16:27:01,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 16:27:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105502 states. [2019-12-27 16:27:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105502 to 42199. [2019-12-27 16:27:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42199 states. [2019-12-27 16:27:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42199 states to 42199 states and 130391 transitions. [2019-12-27 16:27:03,085 INFO L78 Accepts]: Start accepts. Automaton has 42199 states and 130391 transitions. Word has length 63 [2019-12-27 16:27:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:03,085 INFO L462 AbstractCegarLoop]: Abstraction has 42199 states and 130391 transitions. [2019-12-27 16:27:03,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:27:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42199 states and 130391 transitions. [2019-12-27 16:27:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:03,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:03,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:03,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-27 16:27:03,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:03,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033813099] [2019-12-27 16:27:03,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:03,197 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-27 16:27:03,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033813099] [2019-12-27 16:27:03,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:03,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:03,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459637492] [2019-12-27 16:27:03,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:03,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:03,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 429 transitions. [2019-12-27 16:27:03,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:03,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:03,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:03,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:03,458 INFO L87 Difference]: Start difference. First operand 42199 states and 130391 transitions. Second operand 3 states. [2019-12-27 16:27:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:03,593 INFO L93 Difference]: Finished difference Result 42198 states and 130389 transitions. [2019-12-27 16:27:03,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:03,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 16:27:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:03,660 INFO L225 Difference]: With dead ends: 42198 [2019-12-27 16:27:03,660 INFO L226 Difference]: Without dead ends: 42198 [2019-12-27 16:27:03,661 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-27 16:27:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42198 states. [2019-12-27 16:27:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42198 to 34013. [2019-12-27 16:27:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34013 states. [2019-12-27 16:27:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34013 states to 34013 states and 106115 transitions. [2019-12-27 16:27:04,715 INFO L78 Accepts]: Start accepts. Automaton has 34013 states and 106115 transitions. Word has length 63 [2019-12-27 16:27:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:04,715 INFO L462 AbstractCegarLoop]: Abstraction has 34013 states and 106115 transitions. [2019-12-27 16:27:04,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34013 states and 106115 transitions. [2019-12-27 16:27:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:27:04,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:04,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:04,757 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 16:27:04,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:04,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754689647] [2019-12-27 16:27:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:04,832 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-27 16:27:04,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754689647] [2019-12-27 16:27:04,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:04,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:04,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083164120] [2019-12-27 16:27:04,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:04,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:05,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 341 transitions. [2019-12-27 16:27:05,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:05,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:27:05,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:05,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:05,159 INFO L87 Difference]: Start difference. First operand 34013 states and 106115 transitions. Second operand 4 states. [2019-12-27 16:27:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:05,476 INFO L93 Difference]: Finished difference Result 32424 states and 98800 transitions. [2019-12-27 16:27:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:05,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 16:27:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:05,523 INFO L225 Difference]: With dead ends: 32424 [2019-12-27 16:27:05,523 INFO L226 Difference]: Without dead ends: 32424 [2019-12-27 16:27:05,523 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-27 16:27:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32424 states. [2019-12-27 16:27:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32424 to 23730. [2019-12-27 16:27:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23730 states. [2019-12-27 16:27:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23730 states to 23730 states and 73243 transitions. [2019-12-27 16:27:05,937 INFO L78 Accepts]: Start accepts. Automaton has 23730 states and 73243 transitions. Word has length 64 [2019-12-27 16:27:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:05,937 INFO L462 AbstractCegarLoop]: Abstraction has 23730 states and 73243 transitions. [2019-12-27 16:27:05,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:27:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 23730 states and 73243 transitions. [2019-12-27 16:27:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:27:05,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:05,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:05,961 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-27 16:27:05,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:05,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330378648] [2019-12-27 16:27:05,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:06,042 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-27 16:27:06,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330378648] [2019-12-27 16:27:06,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:06,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:27:06,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578506454] [2019-12-27 16:27:06,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:06,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:06,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 654 transitions. [2019-12-27 16:27:06,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:06,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:27:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:27:06,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:27:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:27:06,479 INFO L87 Difference]: Start difference. First operand 23730 states and 73243 transitions. Second operand 8 states. [2019-12-27 16:27:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:07,554 INFO L93 Difference]: Finished difference Result 32729 states and 99600 transitions. [2019-12-27 16:27:07,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:27:07,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 16:27:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:07,599 INFO L225 Difference]: With dead ends: 32729 [2019-12-27 16:27:07,600 INFO L226 Difference]: Without dead ends: 32729 [2019-12-27 16:27:07,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:27:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32729 states. [2019-12-27 16:27:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32729 to 25521. [2019-12-27 16:27:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25521 states. [2019-12-27 16:27:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25521 states to 25521 states and 78643 transitions. [2019-12-27 16:27:08,331 INFO L78 Accepts]: Start accepts. Automaton has 25521 states and 78643 transitions. Word has length 65 [2019-12-27 16:27:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:08,331 INFO L462 AbstractCegarLoop]: Abstraction has 25521 states and 78643 transitions. [2019-12-27 16:27:08,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:27:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 25521 states and 78643 transitions. [2019-12-27 16:27:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:27:08,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:08,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:08,359 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-27 16:27:08,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:08,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643156185] [2019-12-27 16:27:08,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:08,429 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-27 16:27:08,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643156185] [2019-12-27 16:27:08,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:08,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:08,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661838001] [2019-12-27 16:27:08,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:08,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:08,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 392 states and 829 transitions. [2019-12-27 16:27:08,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:08,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:27:08,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:08,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:08,831 INFO L87 Difference]: Start difference. First operand 25521 states and 78643 transitions. Second operand 3 states. [2019-12-27 16:27:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:08,960 INFO L93 Difference]: Finished difference Result 30392 states and 93222 transitions. [2019-12-27 16:27:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:08,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:27:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:09,001 INFO L225 Difference]: With dead ends: 30392 [2019-12-27 16:27:09,001 INFO L226 Difference]: Without dead ends: 30392 [2019-12-27 16:27:09,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-27 16:27:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 25588. [2019-12-27 16:27:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25588 states. [2019-12-27 16:27:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25588 states to 25588 states and 79135 transitions. [2019-12-27 16:27:09,440 INFO L78 Accepts]: Start accepts. Automaton has 25588 states and 79135 transitions. Word has length 65 [2019-12-27 16:27:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:09,440 INFO L462 AbstractCegarLoop]: Abstraction has 25588 states and 79135 transitions. [2019-12-27 16:27:09,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25588 states and 79135 transitions. [2019-12-27 16:27:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:09,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:09,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:09,472 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:09,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 16:27:09,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:09,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208609912] [2019-12-27 16:27:09,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:09,659 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-27 16:27:09,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208609912] [2019-12-27 16:27:09,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:09,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:09,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110489572] [2019-12-27 16:27:09,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:09,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:10,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 325 states and 657 transitions. [2019-12-27 16:27:10,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:10,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:27:10,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:27:10,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:27:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:27:10,840 INFO L87 Difference]: Start difference. First operand 25588 states and 79135 transitions. Second operand 13 states. [2019-12-27 16:27:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:12,903 INFO L93 Difference]: Finished difference Result 55308 states and 171410 transitions. [2019-12-27 16:27:12,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 16:27:12,908 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 16:27:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:12,986 INFO L225 Difference]: With dead ends: 55308 [2019-12-27 16:27:12,986 INFO L226 Difference]: Without dead ends: 52700 [2019-12-27 16:27:12,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:27:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52700 states. [2019-12-27 16:27:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52700 to 30963. [2019-12-27 16:27:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30963 states. [2019-12-27 16:27:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30963 states to 30963 states and 95635 transitions. [2019-12-27 16:27:13,629 INFO L78 Accepts]: Start accepts. Automaton has 30963 states and 95635 transitions. Word has length 66 [2019-12-27 16:27:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:13,629 INFO L462 AbstractCegarLoop]: Abstraction has 30963 states and 95635 transitions. [2019-12-27 16:27:13,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:27:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30963 states and 95635 transitions. [2019-12-27 16:27:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:13,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:13,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:13,662 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-27 16:27:13,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:13,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728598158] [2019-12-27 16:27:13,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:13,816 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-27 16:27:13,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728598158] [2019-12-27 16:27:13,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:13,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:13,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1230114105] [2019-12-27 16:27:13,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:13,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:14,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 397 states and 834 transitions. [2019-12-27 16:27:14,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:14,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:27:14,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:27:14,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:14,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:27:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:27:14,620 INFO L87 Difference]: Start difference. First operand 30963 states and 95635 transitions. Second operand 14 states. [2019-12-27 16:27:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:17,657 INFO L93 Difference]: Finished difference Result 66450 states and 203905 transitions. [2019-12-27 16:27:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:27:17,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:27:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:17,738 INFO L225 Difference]: With dead ends: 66450 [2019-12-27 16:27:17,738 INFO L226 Difference]: Without dead ends: 56339 [2019-12-27 16:27:17,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 16:27:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56339 states. [2019-12-27 16:27:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56339 to 25490. [2019-12-27 16:27:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25490 states. [2019-12-27 16:27:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25490 states to 25490 states and 78141 transitions. [2019-12-27 16:27:18,339 INFO L78 Accepts]: Start accepts. Automaton has 25490 states and 78141 transitions. Word has length 66 [2019-12-27 16:27:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:18,340 INFO L462 AbstractCegarLoop]: Abstraction has 25490 states and 78141 transitions. [2019-12-27 16:27:18,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:27:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25490 states and 78141 transitions. [2019-12-27 16:27:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:18,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:18,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:18,365 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-27 16:27:18,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:18,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071642803] [2019-12-27 16:27:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:18,537 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-27 16:27:18,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071642803] [2019-12-27 16:27:18,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:18,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:27:18,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461282765] [2019-12-27 16:27:18,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:18,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:18,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 668 transitions. [2019-12-27 16:27:18,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:19,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 16:27:19,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:27:19,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:27:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:27:19,312 INFO L87 Difference]: Start difference. First operand 25490 states and 78141 transitions. Second operand 14 states. [2019-12-27 16:27:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:20,676 INFO L93 Difference]: Finished difference Result 44077 states and 134863 transitions. [2019-12-27 16:27:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:27:20,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:27:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:20,738 INFO L225 Difference]: With dead ends: 44077 [2019-12-27 16:27:20,738 INFO L226 Difference]: Without dead ends: 42836 [2019-12-27 16:27:20,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2019-12-27 16:27:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42836 states. [2019-12-27 16:27:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42836 to 24642. [2019-12-27 16:27:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24642 states. [2019-12-27 16:27:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24642 states to 24642 states and 75828 transitions. [2019-12-27 16:27:21,261 INFO L78 Accepts]: Start accepts. Automaton has 24642 states and 75828 transitions. Word has length 66 [2019-12-27 16:27:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:21,261 INFO L462 AbstractCegarLoop]: Abstraction has 24642 states and 75828 transitions. [2019-12-27 16:27:21,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:27:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 24642 states and 75828 transitions. [2019-12-27 16:27:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:21,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:21,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:21,290 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 4 times [2019-12-27 16:27:21,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:21,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313920172] [2019-12-27 16:27:21,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:21,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:27:21,418 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:27:21,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t660~0.base_22| 4)) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t660~0.base_22|)) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (store .cse0 |v_ULTIMATE.start_main_~#t660~0.base_22| 1) |v_#valid_69|) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_22|) |v_ULTIMATE.start_main_~#t660~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= |v_ULTIMATE.start_main_~#t660~0.offset_16| 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t660~0.base_22|) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ULTIMATE.start_main_~#t660~0.offset=|v_ULTIMATE.start_main_~#t660~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ULTIMATE.start_main_~#t660~0.base=|v_ULTIMATE.start_main_~#t660~0.base_22|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t660~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t661~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t660~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 16:27:21,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:21,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t661~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11|) |v_ULTIMATE.start_main_~#t661~0.offset_10| 1))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t661~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t661~0.base_11|) (= |v_ULTIMATE.start_main_~#t661~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t661~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 16:27:21,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12|) |v_ULTIMATE.start_main_~#t662~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t662~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t662~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t662~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t662~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_~#t662~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 16:27:21,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1396274306 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1396274306| |P1Thread1of1ForFork2_#t~ite9_Out-1396274306|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1396274306 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1396274306| ~z~0_In-1396274306)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1396274306| ~z$w_buff1~0_In-1396274306) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1396274306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1396274306, ~z$w_buff1~0=~z$w_buff1~0_In-1396274306, ~z~0=~z~0_In-1396274306} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1396274306|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1396274306, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1396274306|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1396274306, ~z$w_buff1~0=~z$w_buff1~0_In-1396274306, ~z~0=~z~0_In-1396274306} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:27:21,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1189501823 256) 0))) (or (and (= ~z$w_buff1~0_In-1189501823 |P2Thread1of1ForFork0_#t~ite24_Out-1189501823|) (= |P2Thread1of1ForFork0_#t~ite23_In-1189501823| |P2Thread1of1ForFork0_#t~ite23_Out-1189501823|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1189501823| |P2Thread1of1ForFork0_#t~ite24_Out-1189501823|) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1189501823| ~z$w_buff1~0_In-1189501823) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1189501823 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1189501823 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1189501823 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1189501823 256) 0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189501823, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189501823, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1189501823|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189501823, ~z$w_buff1~0=~z$w_buff1~0_In-1189501823, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189501823, ~weak$$choice2~0=~weak$$choice2~0_In-1189501823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189501823, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1189501823|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189501823, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1189501823|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189501823, ~z$w_buff1~0=~z$w_buff1~0_In-1189501823, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189501823, ~weak$$choice2~0=~weak$$choice2~0_In-1189501823} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:27:21,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= |P2Thread1of1ForFork0_#t~ite30_Out-449976368| |P2Thread1of1ForFork0_#t~ite29_Out-449976368|)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-449976368 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-449976368 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-449976368 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-449976368 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-449976368 256)))) (or (let ((.cse1 (not .cse6))) (and (not .cse0) (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) (= |P2Thread1of1ForFork0_#t~ite28_Out-449976368| |P2Thread1of1ForFork0_#t~ite29_Out-449976368|) .cse4 (= |P2Thread1of1ForFork0_#t~ite28_Out-449976368| 0) .cse5)) (and (= |P2Thread1of1ForFork0_#t~ite28_In-449976368| |P2Thread1of1ForFork0_#t~ite28_Out-449976368|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-449976368| ~z$w_buff1_used~0_In-449976368) .cse4 .cse5 (or (and .cse3 .cse6) .cse0 (and .cse2 .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite29_In-449976368| |P2Thread1of1ForFork0_#t~ite29_Out-449976368|) (not .cse5) (= |P2Thread1of1ForFork0_#t~ite30_Out-449976368| ~z$w_buff1_used~0_In-449976368)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-449976368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-449976368, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-449976368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449976368, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-449976368, ~weak$$choice2~0=~weak$$choice2~0_In-449976368, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-449976368|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-449976368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-449976368, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-449976368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449976368, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-449976368, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-449976368|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-449976368|, ~weak$$choice2~0=~weak$$choice2~0_In-449976368} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:21,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:21,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:27:21,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out1204884978| |P2Thread1of1ForFork0_#t~ite38_Out1204884978|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1204884978 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1204884978 256)))) (or (and .cse0 (= ~z~0_In1204884978 |P2Thread1of1ForFork0_#t~ite38_Out1204884978|) (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In1204884978 |P2Thread1of1ForFork0_#t~ite38_Out1204884978|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1204884978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1204884978, ~z$w_buff1~0=~z$w_buff1~0_In1204884978, ~z~0=~z~0_In1204884978} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1204884978|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1204884978|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1204884978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1204884978, ~z$w_buff1~0=~z$w_buff1~0_In1204884978, ~z~0=~z~0_In1204884978} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:27:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-197256964 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-197256964 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-197256964|)) (and (= ~z$w_buff0_used~0_In-197256964 |P2Thread1of1ForFork0_#t~ite40_Out-197256964|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-197256964, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-197256964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-197256964, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-197256964|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-197256964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:27:21,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-752363902 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-752363902 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-752363902 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-752363902 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-752363902| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-752363902| ~z$w_buff1_used~0_In-752363902) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-752363902, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-752363902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-752363902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-752363902} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-752363902, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-752363902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-752363902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-752363902, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-752363902|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:27:21,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In797865208 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In797865208 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out797865208| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out797865208| ~z$r_buff0_thd3~0_In797865208)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In797865208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797865208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In797865208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In797865208, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out797865208|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:27:21,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In303318246 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In303318246 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In303318246 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In303318246 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out303318246| ~z$r_buff1_thd3~0_In303318246) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite43_Out303318246| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In303318246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In303318246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In303318246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In303318246} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out303318246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In303318246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In303318246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In303318246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In303318246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:27:21,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:27:21,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1241388700 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1241388700 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1241388700 |P0Thread1of1ForFork1_#t~ite5_Out1241388700|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1241388700|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1241388700, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1241388700} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1241388700|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1241388700, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1241388700} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:27:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-1294529470 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1294529470 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1294529470 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1294529470 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1294529470 |P0Thread1of1ForFork1_#t~ite6_Out-1294529470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1294529470|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294529470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294529470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294529470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294529470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294529470, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1294529470|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294529470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294529470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294529470} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:27:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1918963101 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1918963101 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1918963101 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1918963101 ~z$r_buff0_thd1~0_In1918963101)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1918963101, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1918963101} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1918963101, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1918963101|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1918963101} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:21,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1576807520 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1576807520 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1576807520 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1576807520 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1576807520|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1576807520 |P0Thread1of1ForFork1_#t~ite8_Out1576807520|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1576807520, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1576807520, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1576807520, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1576807520} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1576807520|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1576807520, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1576807520, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1576807520, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1576807520} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:27:21,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:27:21,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-826034380 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-826034380 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-826034380| ~z$w_buff0_used~0_In-826034380) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-826034380| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-826034380, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-826034380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-826034380, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-826034380|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-826034380} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:27:21,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1556112455 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1556112455 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1556112455 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1556112455 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1556112455| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1556112455| ~z$w_buff1_used~0_In1556112455)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1556112455, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1556112455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1556112455, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1556112455} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1556112455, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1556112455, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1556112455, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1556112455|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1556112455} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:27:21,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-371020964 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-371020964 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-371020964| ~z$r_buff0_thd2~0_In-371020964)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-371020964| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-371020964, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-371020964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-371020964, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-371020964|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-371020964} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:27:21,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1402677670 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1402677670 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1402677670 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1402677670 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1402677670| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1402677670| ~z$r_buff1_thd2~0_In1402677670) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402677670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1402677670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402677670, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402677670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1402677670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1402677670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402677670, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1402677670|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402677670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:27:21,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:27:21,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:27:21,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1009786003 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1009786003 256)))) (or (and (= ~z~0_In1009786003 |ULTIMATE.start_main_#t~ite47_Out1009786003|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In1009786003 |ULTIMATE.start_main_#t~ite47_Out1009786003|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1009786003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009786003, ~z$w_buff1~0=~z$w_buff1~0_In1009786003, ~z~0=~z~0_In1009786003} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1009786003, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1009786003|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009786003, ~z$w_buff1~0=~z$w_buff1~0_In1009786003, ~z~0=~z~0_In1009786003} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:27:21,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:27:21,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In984326932 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In984326932 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In984326932 |ULTIMATE.start_main_#t~ite49_Out984326932|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out984326932|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In984326932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In984326932} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In984326932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In984326932, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out984326932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:27:21,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1759495903 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1759495903 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1759495903 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1759495903 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1759495903|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1759495903 |ULTIMATE.start_main_#t~ite50_Out1759495903|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759495903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759495903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1759495903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1759495903} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1759495903|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759495903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759495903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1759495903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1759495903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:27:21,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1996476522 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1996476522 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1996476522|)) (and (= ~z$r_buff0_thd0~0_In-1996476522 |ULTIMATE.start_main_#t~ite51_Out-1996476522|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1996476522, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1996476522} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1996476522, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1996476522|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1996476522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:27:21,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1078474468 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1078474468 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1078474468 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1078474468 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1078474468|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-1078474468 |ULTIMATE.start_main_#t~ite52_Out-1078474468|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1078474468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1078474468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1078474468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1078474468} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1078474468|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1078474468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1078474468, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1078474468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1078474468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:27:21,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:27:21,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:27:21 BasicIcfg [2019-12-27 16:27:21,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:27:21,569 INFO L168 Benchmark]: Toolchain (without parser) took 134728.56 ms. Allocated memory was 138.9 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.2 MB in the beginning and 966.6 MB in the end (delta: -864.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,570 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.28 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.3 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,571 INFO L168 Benchmark]: Boogie Preprocessor took 74.21 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,572 INFO L168 Benchmark]: RCFGBuilder took 857.61 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,579 INFO L168 Benchmark]: TraceAbstraction took 132917.75 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.2 MB in the beginning and 966.6 MB in the end (delta: -868.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:21,581 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.28 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.3 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.21 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.61 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132917.75 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.2 MB in the beginning and 966.6 MB in the end (delta: -868.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t660, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t661, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t662, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 132.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8429 SDtfs, 12053 SDslu, 28387 SDs, 0 SdLazy, 18849 SolverSat, 752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 226 SyntacticMatches, 86 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 48.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 505723 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1381 NumberOfCodeBlocks, 1381 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 260352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...