/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:34:41,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:34:41,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:34:41,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:34:41,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:34:41,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:34:41,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:34:41,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:34:41,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:34:41,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:34:41,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:34:41,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:34:41,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:34:41,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:34:41,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:34:41,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:34:41,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:34:41,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:34:41,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:34:41,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:34:41,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:34:41,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:34:41,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:34:41,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:34:41,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:34:41,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:34:41,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:34:41,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:34:41,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:34:41,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:34:41,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:34:41,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:34:41,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:34:41,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:34:41,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:34:41,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:34:41,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:34:41,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:34:41,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:34:41,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:34:41,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:34:41,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:34:41,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:34:41,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:34:41,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:34:41,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:34:41,531 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:34:41,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:34:41,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:34:41,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:34:41,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:34:41,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:34:41,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:34:41,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:34:41,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:34:41,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:34:41,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:34:41,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:34:41,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:34:41,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:34:41,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:34:41,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:34:41,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:34:41,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:34:41,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:34:41,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:34:41,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:34:41,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:34:41,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:34:41,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:34:41,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:34:41,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:34:41,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:34:41,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:34:41,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:34:41,856 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:34:41,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 18:34:41,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d140bed15/da3c130d74124ac09a0db425bc3a2626/FLAG48392ad59 [2019-12-18 18:34:42,535 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:34:42,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 18:34:42,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d140bed15/da3c130d74124ac09a0db425bc3a2626/FLAG48392ad59 [2019-12-18 18:34:42,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d140bed15/da3c130d74124ac09a0db425bc3a2626 [2019-12-18 18:34:42,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:34:42,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:34:42,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:34:42,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:34:42,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:34:42,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:34:42" (1/1) ... [2019-12-18 18:34:42,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2398fa85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:42, skipping insertion in model container [2019-12-18 18:34:42,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:34:42" (1/1) ... [2019-12-18 18:34:42,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:34:42,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:34:43,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:34:43,506 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:34:43,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:34:43,680 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:34:43,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43 WrapperNode [2019-12-18 18:34:43,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:34:43,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:34:43,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:34:43,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:34:43,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:34:43,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:34:43,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:34:43,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:34:43,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... [2019-12-18 18:34:43,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:34:43,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:34:43,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:34:43,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:34:43,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:34:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:34:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:34:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:34:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:34:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:34:43,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:34:43,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:34:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:34:43,873 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:34:43,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:34:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:34:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:34:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:34:43,878 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:34:44,711 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:34:44,712 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:34:44,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:34:44 BoogieIcfgContainer [2019-12-18 18:34:44,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:34:44,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:34:44,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:34:44,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:34:44,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:34:42" (1/3) ... [2019-12-18 18:34:44,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2dfb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:34:44, skipping insertion in model container [2019-12-18 18:34:44,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:43" (2/3) ... [2019-12-18 18:34:44,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2dfb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:34:44, skipping insertion in model container [2019-12-18 18:34:44,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:34:44" (3/3) ... [2019-12-18 18:34:44,722 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-18 18:34:44,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:34:44,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:34:44,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:34:44,738 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:34:44,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,841 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,841 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:44,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:34:44,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:34:44,886 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:34:44,886 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:34:44,886 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:34:44,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:34:44,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:34:44,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:34:44,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:34:44,901 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 18:34:44,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:34:44,987 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:34:44,987 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:34:45,005 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:34:45,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:34:45,096 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:34:45,096 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:34:45,106 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:34:45,126 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:34:45,127 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:34:50,253 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:34:50,387 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:34:50,498 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-18 18:34:50,498 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 18:34:50,502 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 18:35:03,749 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 18:35:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 18:35:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:35:03,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:03,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:35:03,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-18 18:35:03,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:03,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463094200] [2019-12-18 18:35:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:04,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463094200] [2019-12-18 18:35:04,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:04,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:35:04,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144649577] [2019-12-18 18:35:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:35:04,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:35:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:04,127 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 18:35:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:06,528 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 18:35:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:35:06,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:35:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:07,190 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 18:35:07,190 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 18:35:07,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 18:35:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 18:35:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 18:35:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 18:35:17,115 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 18:35:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:17,115 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 18:35:17,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:35:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 18:35:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:35:17,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:17,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:17,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-18 18:35:17,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:17,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070464507] [2019-12-18 18:35:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:17,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070464507] [2019-12-18 18:35:17,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:17,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:35:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528368365] [2019-12-18 18:35:17,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:35:17,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:35:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:35:17,241 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 18:35:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:18,151 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 18:35:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:35:18,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:35:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:22,705 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 18:35:22,705 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 18:35:22,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 18:35:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 18:35:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 18:35:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 18:35:28,875 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 18:35:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:28,876 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 18:35:28,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:35:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 18:35:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:35:28,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:28,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:28,880 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-18 18:35:28,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:28,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452295732] [2019-12-18 18:35:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:28,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452295732] [2019-12-18 18:35:28,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:28,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:35:28,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035975947] [2019-12-18 18:35:28,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:35:28,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:35:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:35:28,981 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 18:35:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:33,761 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 18:35:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:35:33,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:35:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:34,432 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 18:35:34,432 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 18:35:34,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 18:35:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 18:35:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 18:35:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 18:35:48,805 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 18:35:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:48,806 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 18:35:48,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:35:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 18:35:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:35:48,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:48,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:48,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-18 18:35:48,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:48,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274555569] [2019-12-18 18:35:48,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:48,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274555569] [2019-12-18 18:35:48,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:48,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:35:48,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74627986] [2019-12-18 18:35:48,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:35:48,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:35:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:48,896 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 18:35:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:49,836 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 18:35:49,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:35:49,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 18:35:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:50,421 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 18:35:50,421 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 18:35:50,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 18:36:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 18:36:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 18:36:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 18:36:06,153 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 18:36:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:06,153 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 18:36:06,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:36:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 18:36:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:36:06,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:06,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:06,156 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-18 18:36:06,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:06,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022700037] [2019-12-18 18:36:06,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:06,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022700037] [2019-12-18 18:36:06,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:06,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:36:06,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658883857] [2019-12-18 18:36:06,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:36:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:36:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:36:06,221 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 18:36:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:12,313 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 18:36:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:36:12,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:36:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:12,891 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 18:36:12,891 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 18:36:12,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:36:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 18:36:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 18:36:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 18:36:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 18:36:21,998 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 18:36:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:21,998 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 18:36:21,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:36:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 18:36:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:36:22,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:22,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:22,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-18 18:36:22,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:22,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138624666] [2019-12-18 18:36:22,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:22,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138624666] [2019-12-18 18:36:22,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:22,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:36:22,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692408341] [2019-12-18 18:36:22,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:36:22,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:22,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:36:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:36:22,061 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 18:36:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:23,139 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 18:36:23,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:36:23,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:36:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:30,444 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 18:36:30,444 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 18:36:30,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:36:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 18:36:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 18:36:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 18:36:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 18:36:38,193 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 18:36:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:38,193 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 18:36:38,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:36:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 18:36:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 18:36:38,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:38,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:38,211 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-18 18:36:38,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:38,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817020121] [2019-12-18 18:36:38,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:38,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-18 18:36:38,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817020121] [2019-12-18 18:36:38,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:38,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:36:38,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850341793] [2019-12-18 18:36:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:36:38,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:36:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:38,261 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 18:36:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:40,102 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 18:36:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:36:40,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 18:36:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:40,562 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 18:36:40,562 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 18:36:40,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 18:36:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 18:36:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 18:36:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 18:36:54,281 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 18:36:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:54,281 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 18:36:54,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:36:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 18:36:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:36:54,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:54,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:54,304 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-18 18:36:54,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:54,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243237530] [2019-12-18 18:36:54,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:54,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243237530] [2019-12-18 18:36:54,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:54,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:36:54,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874280253] [2019-12-18 18:36:54,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:36:54,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:36:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:36:54,360 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 18:37:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:01,100 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-18 18:37:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:37:01,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:37:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:01,514 INFO L225 Difference]: With dead ends: 255238 [2019-12-18 18:37:01,514 INFO L226 Difference]: Without dead ends: 128270 [2019-12-18 18:37:01,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:37:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-18 18:37:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-18 18:37:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-18 18:37:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-18 18:37:08,295 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-18 18:37:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:08,295 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-18 18:37:08,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:37:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-18 18:37:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:37:08,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:08,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:08,309 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-18 18:37:08,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:08,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141543363] [2019-12-18 18:37:08,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:08,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141543363] [2019-12-18 18:37:08,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:08,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:37:08,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699424035] [2019-12-18 18:37:08,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:37:08,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:37:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:37:08,425 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-18 18:37:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:08,598 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-18 18:37:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:37:08,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:37:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:08,654 INFO L225 Difference]: With dead ends: 36423 [2019-12-18 18:37:08,655 INFO L226 Difference]: Without dead ends: 28545 [2019-12-18 18:37:08,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:37:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-18 18:37:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-18 18:37:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-18 18:37:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-18 18:37:10,083 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-18 18:37:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:10,084 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-18 18:37:10,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:37:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-18 18:37:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:37:10,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:10,089 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-18 18:37:10,089 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-18 18:37:10,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:10,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864499909] [2019-12-18 18:37:10,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:10,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864499909] [2019-12-18 18:37:10,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:10,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:37:10,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474391759] [2019-12-18 18:37:10,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:37:10,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:37:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:37:10,149 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-18 18:37:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:10,645 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-18 18:37:10,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:37:10,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 18:37:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:10,713 INFO L225 Difference]: With dead ends: 37265 [2019-12-18 18:37:10,713 INFO L226 Difference]: Without dead ends: 36963 [2019-12-18 18:37:10,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:37:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-18 18:37:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-18 18:37:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-18 18:37:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-18 18:37:11,274 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-18 18:37:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:11,275 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-18 18:37:11,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:37:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-18 18:37:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:37:11,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:11,280 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-18 18:37:11,280 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-18 18:37:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:11,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734810160] [2019-12-18 18:37:11,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:11,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734810160] [2019-12-18 18:37:11,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:11,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:37:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225001186] [2019-12-18 18:37:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:37:11,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:37:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:37:11,336 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-18 18:37:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:13,513 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-18 18:37:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:37:13,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 18:37:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:13,605 INFO L225 Difference]: With dead ends: 37362 [2019-12-18 18:37:13,606 INFO L226 Difference]: Without dead ends: 36942 [2019-12-18 18:37:13,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:37:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-18 18:37:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-18 18:37:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 18:37:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-18 18:37:14,161 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-18 18:37:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:14,161 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-18 18:37:14,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:37:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-18 18:37:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:37:14,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:14,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:14,169 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-18 18:37:14,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:14,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226278480] [2019-12-18 18:37:14,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:14,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226278480] [2019-12-18 18:37:14,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:14,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:37:14,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537238272] [2019-12-18 18:37:14,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:37:14,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:14,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:37:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:37:14,230 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-18 18:37:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:14,325 INFO L93 Difference]: Finished difference Result 12955 states and 39860 transitions. [2019-12-18 18:37:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:37:14,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:37:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:14,345 INFO L225 Difference]: With dead ends: 12955 [2019-12-18 18:37:14,346 INFO L226 Difference]: Without dead ends: 11071 [2019-12-18 18:37:14,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:37:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-12-18 18:37:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 11023. [2019-12-18 18:37:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11023 states. [2019-12-18 18:37:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11023 states to 11023 states and 33656 transitions. [2019-12-18 18:37:14,542 INFO L78 Accepts]: Start accepts. Automaton has 11023 states and 33656 transitions. Word has length 25 [2019-12-18 18:37:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:14,542 INFO L462 AbstractCegarLoop]: Abstraction has 11023 states and 33656 transitions. [2019-12-18 18:37:14,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:37:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11023 states and 33656 transitions. [2019-12-18 18:37:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:37:14,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:14,557 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-18 18:37:14,557 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1034846780, now seen corresponding path program 1 times [2019-12-18 18:37:14,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:14,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698873385] [2019-12-18 18:37:14,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:14,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698873385] [2019-12-18 18:37:14,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:14,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:37:14,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096527707] [2019-12-18 18:37:14,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:37:14,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:37:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:37:14,611 INFO L87 Difference]: Start difference. First operand 11023 states and 33656 transitions. Second operand 3 states. [2019-12-18 18:37:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:14,675 INFO L93 Difference]: Finished difference Result 16986 states and 52244 transitions. [2019-12-18 18:37:14,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:37:14,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:37:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:14,686 INFO L225 Difference]: With dead ends: 16986 [2019-12-18 18:37:14,686 INFO L226 Difference]: Without dead ends: 6707 [2019-12-18 18:37:14,686 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-18 18:37:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2019-12-18 18:37:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6376. [2019-12-18 18:37:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6376 states. [2019-12-18 18:37:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6376 states to 6376 states and 19609 transitions. [2019-12-18 18:37:14,792 INFO L78 Accepts]: Start accepts. Automaton has 6376 states and 19609 transitions. Word has length 39 [2019-12-18 18:37:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:14,792 INFO L462 AbstractCegarLoop]: Abstraction has 6376 states and 19609 transitions. [2019-12-18 18:37:14,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:37:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6376 states and 19609 transitions. [2019-12-18 18:37:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:37:14,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:14,801 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-18 18:37:14,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-18 18:37:14,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:14,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561926328] [2019-12-18 18:37:14,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:14,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561926328] [2019-12-18 18:37:14,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:14,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:37:14,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213879268] [2019-12-18 18:37:14,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:37:14,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:37:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:37:14,905 INFO L87 Difference]: Start difference. First operand 6376 states and 19609 transitions. Second operand 6 states. [2019-12-18 18:37:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:15,005 INFO L93 Difference]: Finished difference Result 5431 states and 17202 transitions. [2019-12-18 18:37:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:37:15,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 18:37:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:15,015 INFO L225 Difference]: With dead ends: 5431 [2019-12-18 18:37:15,015 INFO L226 Difference]: Without dead ends: 4931 [2019-12-18 18:37:15,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:37:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2019-12-18 18:37:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4931. [2019-12-18 18:37:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-12-18 18:37:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 16137 transitions. [2019-12-18 18:37:15,104 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 16137 transitions. Word has length 40 [2019-12-18 18:37:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:15,104 INFO L462 AbstractCegarLoop]: Abstraction has 4931 states and 16137 transitions. [2019-12-18 18:37:15,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:37:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 16137 transitions. [2019-12-18 18:37:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:15,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:15,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:15,112 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1051329167, now seen corresponding path program 1 times [2019-12-18 18:37:15,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:15,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267725263] [2019-12-18 18:37:15,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:15,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267725263] [2019-12-18 18:37:15,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:15,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:37:15,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409181857] [2019-12-18 18:37:15,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:37:15,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:37:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:37:15,322 INFO L87 Difference]: Start difference. First operand 4931 states and 16137 transitions. Second operand 7 states. [2019-12-18 18:37:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:15,554 INFO L93 Difference]: Finished difference Result 9337 states and 29983 transitions. [2019-12-18 18:37:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:37:15,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:37:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:15,568 INFO L225 Difference]: With dead ends: 9337 [2019-12-18 18:37:15,568 INFO L226 Difference]: Without dead ends: 6757 [2019-12-18 18:37:15,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:37:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-12-18 18:37:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6111. [2019-12-18 18:37:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6111 states. [2019-12-18 18:37:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 19904 transitions. [2019-12-18 18:37:15,688 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 19904 transitions. Word has length 54 [2019-12-18 18:37:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:15,688 INFO L462 AbstractCegarLoop]: Abstraction has 6111 states and 19904 transitions. [2019-12-18 18:37:15,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:37:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 19904 transitions. [2019-12-18 18:37:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:15,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:15,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:15,699 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -804799887, now seen corresponding path program 2 times [2019-12-18 18:37:15,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:15,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846132291] [2019-12-18 18:37:15,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:15,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846132291] [2019-12-18 18:37:15,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:15,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:37:15,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469446463] [2019-12-18 18:37:15,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:37:15,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:37:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:37:15,788 INFO L87 Difference]: Start difference. First operand 6111 states and 19904 transitions. Second operand 7 states. [2019-12-18 18:37:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:16,056 INFO L93 Difference]: Finished difference Result 11352 states and 36114 transitions. [2019-12-18 18:37:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:37:16,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:37:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:16,074 INFO L225 Difference]: With dead ends: 11352 [2019-12-18 18:37:16,074 INFO L226 Difference]: Without dead ends: 8293 [2019-12-18 18:37:16,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:37:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8293 states. [2019-12-18 18:37:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8293 to 7465. [2019-12-18 18:37:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2019-12-18 18:37:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24070 transitions. [2019-12-18 18:37:16,225 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24070 transitions. Word has length 54 [2019-12-18 18:37:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:16,225 INFO L462 AbstractCegarLoop]: Abstraction has 7465 states and 24070 transitions. [2019-12-18 18:37:16,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:37:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24070 transitions. [2019-12-18 18:37:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:16,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:16,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:16,235 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1606219021, now seen corresponding path program 3 times [2019-12-18 18:37:16,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771814684] [2019-12-18 18:37:16,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:16,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771814684] [2019-12-18 18:37:16,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:16,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:37:16,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10661777] [2019-12-18 18:37:16,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:37:16,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:37:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:37:16,345 INFO L87 Difference]: Start difference. First operand 7465 states and 24070 transitions. Second operand 8 states. [2019-12-18 18:37:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:17,099 INFO L93 Difference]: Finished difference Result 15765 states and 48403 transitions. [2019-12-18 18:37:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:37:17,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 18:37:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:17,121 INFO L225 Difference]: With dead ends: 15765 [2019-12-18 18:37:17,121 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 18:37:17,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:37:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 18:37:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 7485. [2019-12-18 18:37:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7485 states. [2019-12-18 18:37:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7485 states to 7485 states and 24077 transitions. [2019-12-18 18:37:17,281 INFO L78 Accepts]: Start accepts. Automaton has 7485 states and 24077 transitions. Word has length 54 [2019-12-18 18:37:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:17,282 INFO L462 AbstractCegarLoop]: Abstraction has 7485 states and 24077 transitions. [2019-12-18 18:37:17,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:37:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7485 states and 24077 transitions. [2019-12-18 18:37:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:17,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:17,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] [2019-12-18 18:37:17,290 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:17,290 INFO L82 PathProgramCache]: Analyzing trace with hash -960363441, now seen corresponding path program 4 times [2019-12-18 18:37:17,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:17,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682744275] [2019-12-18 18:37:17,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:17,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682744275] [2019-12-18 18:37:17,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:17,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:37:17,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440433064] [2019-12-18 18:37:17,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:37:17,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:37:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:37:17,403 INFO L87 Difference]: Start difference. First operand 7485 states and 24077 transitions. Second operand 9 states. [2019-12-18 18:37:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:18,508 INFO L93 Difference]: Finished difference Result 21985 states and 67528 transitions. [2019-12-18 18:37:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:37:18,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 18:37:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:18,539 INFO L225 Difference]: With dead ends: 21985 [2019-12-18 18:37:18,539 INFO L226 Difference]: Without dead ends: 19611 [2019-12-18 18:37:18,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:37:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2019-12-18 18:37:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 7345. [2019-12-18 18:37:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-12-18 18:37:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 23640 transitions. [2019-12-18 18:37:18,843 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 23640 transitions. Word has length 54 [2019-12-18 18:37:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:18,843 INFO L462 AbstractCegarLoop]: Abstraction has 7345 states and 23640 transitions. [2019-12-18 18:37:18,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:37:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 23640 transitions. [2019-12-18 18:37:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:18,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:18,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:18,852 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1713990903, now seen corresponding path program 5 times [2019-12-18 18:37:18,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:18,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986704830] [2019-12-18 18:37:18,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986704830] [2019-12-18 18:37:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:18,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:37:18,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135567655] [2019-12-18 18:37:18,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:37:18,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:37:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:37:18,964 INFO L87 Difference]: Start difference. First operand 7345 states and 23640 transitions. Second operand 9 states. [2019-12-18 18:37:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:20,217 INFO L93 Difference]: Finished difference Result 29906 states and 91897 transitions. [2019-12-18 18:37:20,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 18:37:20,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 18:37:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:20,255 INFO L225 Difference]: With dead ends: 29906 [2019-12-18 18:37:20,255 INFO L226 Difference]: Without dead ends: 23860 [2019-12-18 18:37:20,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 18:37:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23860 states. [2019-12-18 18:37:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23860 to 9261. [2019-12-18 18:37:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-12-18 18:37:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 29911 transitions. [2019-12-18 18:37:20,517 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 29911 transitions. Word has length 54 [2019-12-18 18:37:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:20,518 INFO L462 AbstractCegarLoop]: Abstraction has 9261 states and 29911 transitions. [2019-12-18 18:37:20,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:37:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 29911 transitions. [2019-12-18 18:37:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:20,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:20,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:20,529 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash -380308885, now seen corresponding path program 6 times [2019-12-18 18:37:20,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:20,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100398904] [2019-12-18 18:37:20,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:20,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100398904] [2019-12-18 18:37:20,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:20,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:37:20,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526383404] [2019-12-18 18:37:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:37:20,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:37:20,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:37:20,625 INFO L87 Difference]: Start difference. First operand 9261 states and 29911 transitions. Second operand 7 states. [2019-12-18 18:37:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:21,402 INFO L93 Difference]: Finished difference Result 20698 states and 64306 transitions. [2019-12-18 18:37:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:37:21,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:37:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:21,435 INFO L225 Difference]: With dead ends: 20698 [2019-12-18 18:37:21,435 INFO L226 Difference]: Without dead ends: 20614 [2019-12-18 18:37:21,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:37:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20614 states. [2019-12-18 18:37:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20614 to 13910. [2019-12-18 18:37:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13910 states. [2019-12-18 18:37:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13910 states to 13910 states and 43369 transitions. [2019-12-18 18:37:21,685 INFO L78 Accepts]: Start accepts. Automaton has 13910 states and 43369 transitions. Word has length 54 [2019-12-18 18:37:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:21,685 INFO L462 AbstractCegarLoop]: Abstraction has 13910 states and 43369 transitions. [2019-12-18 18:37:21,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:37:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13910 states and 43369 transitions. [2019-12-18 18:37:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:21,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:21,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:21,702 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1744394997, now seen corresponding path program 7 times [2019-12-18 18:37:21,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:21,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453891256] [2019-12-18 18:37:21,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:21,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453891256] [2019-12-18 18:37:21,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:21,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:37:21,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914727616] [2019-12-18 18:37:21,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:37:21,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:37:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:37:21,793 INFO L87 Difference]: Start difference. First operand 13910 states and 43369 transitions. Second operand 6 states. [2019-12-18 18:37:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:22,491 INFO L93 Difference]: Finished difference Result 21611 states and 65806 transitions. [2019-12-18 18:37:22,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:37:22,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 18:37:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:22,523 INFO L225 Difference]: With dead ends: 21611 [2019-12-18 18:37:22,523 INFO L226 Difference]: Without dead ends: 21501 [2019-12-18 18:37:22,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:37:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21501 states. [2019-12-18 18:37:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21501 to 18077. [2019-12-18 18:37:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18077 states. [2019-12-18 18:37:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18077 states to 18077 states and 56064 transitions. [2019-12-18 18:37:22,833 INFO L78 Accepts]: Start accepts. Automaton has 18077 states and 56064 transitions. Word has length 54 [2019-12-18 18:37:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:22,833 INFO L462 AbstractCegarLoop]: Abstraction has 18077 states and 56064 transitions. [2019-12-18 18:37:22,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:37:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18077 states and 56064 transitions. [2019-12-18 18:37:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:37:22,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:22,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:37:22,861 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash -202798091, now seen corresponding path program 8 times [2019-12-18 18:37:22,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:22,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484006345] [2019-12-18 18:37:22,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:22,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484006345] [2019-12-18 18:37:22,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:22,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:37:22,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260153334] [2019-12-18 18:37:22,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:37:22,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:37:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:37:22,930 INFO L87 Difference]: Start difference. First operand 18077 states and 56064 transitions. Second operand 3 states. [2019-12-18 18:37:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:23,016 INFO L93 Difference]: Finished difference Result 18075 states and 56059 transitions. [2019-12-18 18:37:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:37:23,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:37:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:23,051 INFO L225 Difference]: With dead ends: 18075 [2019-12-18 18:37:23,052 INFO L226 Difference]: Without dead ends: 18075 [2019-12-18 18:37:23,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:37:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18075 states. [2019-12-18 18:37:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18075 to 16064. [2019-12-18 18:37:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16064 states. [2019-12-18 18:37:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16064 states to 16064 states and 50477 transitions. [2019-12-18 18:37:23,353 INFO L78 Accepts]: Start accepts. Automaton has 16064 states and 50477 transitions. Word has length 54 [2019-12-18 18:37:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:23,353 INFO L462 AbstractCegarLoop]: Abstraction has 16064 states and 50477 transitions. [2019-12-18 18:37:23,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:37:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16064 states and 50477 transitions. [2019-12-18 18:37:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:37:23,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:23,373 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] [2019-12-18 18:37:23,373 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 1 times [2019-12-18 18:37:23,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:23,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245548207] [2019-12-18 18:37:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:23,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-18 18:37:23,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245548207] [2019-12-18 18:37:23,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:23,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:37:23,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000678219] [2019-12-18 18:37:23,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:37:23,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:23,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:37:23,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:37:23,431 INFO L87 Difference]: Start difference. First operand 16064 states and 50477 transitions. Second operand 3 states. [2019-12-18 18:37:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:23,495 INFO L93 Difference]: Finished difference Result 11094 states and 34537 transitions. [2019-12-18 18:37:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:37:23,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:37:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:23,516 INFO L225 Difference]: With dead ends: 11094 [2019-12-18 18:37:23,516 INFO L226 Difference]: Without dead ends: 11094 [2019-12-18 18:37:23,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:37:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11094 states. [2019-12-18 18:37:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11094 to 10908. [2019-12-18 18:37:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-12-18 18:37:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 34016 transitions. [2019-12-18 18:37:23,835 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 34016 transitions. Word has length 55 [2019-12-18 18:37:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:23,835 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 34016 transitions. [2019-12-18 18:37:23,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:37:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 34016 transitions. [2019-12-18 18:37:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:23,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:23,855 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] [2019-12-18 18:37:23,856 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-18 18:37:23,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:23,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701273667] [2019-12-18 18:37:23,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:24,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701273667] [2019-12-18 18:37:24,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:24,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:37:24,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916818045] [2019-12-18 18:37:24,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:37:24,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:37:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:37:24,476 INFO L87 Difference]: Start difference. First operand 10908 states and 34016 transitions. Second operand 16 states. [2019-12-18 18:37:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:28,068 INFO L93 Difference]: Finished difference Result 17780 states and 54266 transitions. [2019-12-18 18:37:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 18:37:28,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:37:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:28,092 INFO L225 Difference]: With dead ends: 17780 [2019-12-18 18:37:28,092 INFO L226 Difference]: Without dead ends: 14688 [2019-12-18 18:37:28,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 18:37:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-12-18 18:37:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 11470. [2019-12-18 18:37:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11470 states. [2019-12-18 18:37:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11470 states to 11470 states and 35507 transitions. [2019-12-18 18:37:28,299 INFO L78 Accepts]: Start accepts. Automaton has 11470 states and 35507 transitions. Word has length 56 [2019-12-18 18:37:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:28,299 INFO L462 AbstractCegarLoop]: Abstraction has 11470 states and 35507 transitions. [2019-12-18 18:37:28,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:37:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11470 states and 35507 transitions. [2019-12-18 18:37:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:28,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:28,313 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] [2019-12-18 18:37:28,313 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666311, now seen corresponding path program 2 times [2019-12-18 18:37:28,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:28,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323000644] [2019-12-18 18:37:28,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:28,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323000644] [2019-12-18 18:37:28,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:28,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:37:28,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364641351] [2019-12-18 18:37:28,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:37:28,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:28,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:37:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:37:28,866 INFO L87 Difference]: Start difference. First operand 11470 states and 35507 transitions. Second operand 16 states. [2019-12-18 18:37:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:31,954 INFO L93 Difference]: Finished difference Result 16759 states and 51023 transitions. [2019-12-18 18:37:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:37:31,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 18:37:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:31,976 INFO L225 Difference]: With dead ends: 16759 [2019-12-18 18:37:31,976 INFO L226 Difference]: Without dead ends: 14517 [2019-12-18 18:37:31,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 18:37:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14517 states. [2019-12-18 18:37:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14517 to 11422. [2019-12-18 18:37:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11422 states. [2019-12-18 18:37:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11422 states to 11422 states and 35383 transitions. [2019-12-18 18:37:32,173 INFO L78 Accepts]: Start accepts. Automaton has 11422 states and 35383 transitions. Word has length 56 [2019-12-18 18:37:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 11422 states and 35383 transitions. [2019-12-18 18:37:32,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:37:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11422 states and 35383 transitions. [2019-12-18 18:37:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:32,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:32,186 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] [2019-12-18 18:37:32,186 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash -337997383, now seen corresponding path program 3 times [2019-12-18 18:37:32,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:32,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024996343] [2019-12-18 18:37:32,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:32,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024996343] [2019-12-18 18:37:32,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:32,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:37:32,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448440720] [2019-12-18 18:37:32,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:37:32,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:37:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:37:32,339 INFO L87 Difference]: Start difference. First operand 11422 states and 35383 transitions. Second operand 10 states. [2019-12-18 18:37:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:33,031 INFO L93 Difference]: Finished difference Result 18419 states and 56192 transitions. [2019-12-18 18:37:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:37:33,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 18:37:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:33,050 INFO L225 Difference]: With dead ends: 18419 [2019-12-18 18:37:33,050 INFO L226 Difference]: Without dead ends: 12728 [2019-12-18 18:37:33,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 18:37:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12728 states. [2019-12-18 18:37:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12728 to 11388. [2019-12-18 18:37:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11388 states. [2019-12-18 18:37:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11388 states to 11388 states and 35047 transitions. [2019-12-18 18:37:33,221 INFO L78 Accepts]: Start accepts. Automaton has 11388 states and 35047 transitions. Word has length 56 [2019-12-18 18:37:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:33,221 INFO L462 AbstractCegarLoop]: Abstraction has 11388 states and 35047 transitions. [2019-12-18 18:37:33,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:37:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11388 states and 35047 transitions. [2019-12-18 18:37:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:33,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:33,232 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] [2019-12-18 18:37:33,232 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 93841739, now seen corresponding path program 4 times [2019-12-18 18:37:33,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:33,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936054556] [2019-12-18 18:37:33,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:33,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936054556] [2019-12-18 18:37:33,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:33,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:37:33,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888276065] [2019-12-18 18:37:33,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:37:33,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:37:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:37:33,768 INFO L87 Difference]: Start difference. First operand 11388 states and 35047 transitions. Second operand 17 states. [2019-12-18 18:37:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:36,479 INFO L93 Difference]: Finished difference Result 17042 states and 51443 transitions. [2019-12-18 18:37:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 18:37:36,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 18:37:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:36,503 INFO L225 Difference]: With dead ends: 17042 [2019-12-18 18:37:36,503 INFO L226 Difference]: Without dead ends: 14800 [2019-12-18 18:37:36,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 18:37:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14800 states. [2019-12-18 18:37:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14800 to 11688. [2019-12-18 18:37:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11688 states. [2019-12-18 18:37:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 35849 transitions. [2019-12-18 18:37:36,818 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 35849 transitions. Word has length 56 [2019-12-18 18:37:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:36,818 INFO L462 AbstractCegarLoop]: Abstraction has 11688 states and 35849 transitions. [2019-12-18 18:37:36,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:37:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 35849 transitions. [2019-12-18 18:37:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:36,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:36,831 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] [2019-12-18 18:37:36,832 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 496878283, now seen corresponding path program 5 times [2019-12-18 18:37:36,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:36,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467629245] [2019-12-18 18:37:36,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:36,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467629245] [2019-12-18 18:37:36,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:36,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:37:36,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400723537] [2019-12-18 18:37:36,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:37:36,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:37:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:37:36,993 INFO L87 Difference]: Start difference. First operand 11688 states and 35849 transitions. Second operand 11 states. [2019-12-18 18:37:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:37,688 INFO L93 Difference]: Finished difference Result 17679 states and 53601 transitions. [2019-12-18 18:37:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:37:37,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:37:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:37,707 INFO L225 Difference]: With dead ends: 17679 [2019-12-18 18:37:37,707 INFO L226 Difference]: Without dead ends: 12020 [2019-12-18 18:37:37,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:37:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2019-12-18 18:37:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11128. [2019-12-18 18:37:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11128 states. [2019-12-18 18:37:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11128 states to 11128 states and 34156 transitions. [2019-12-18 18:37:37,881 INFO L78 Accepts]: Start accepts. Automaton has 11128 states and 34156 transitions. Word has length 56 [2019-12-18 18:37:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:37,881 INFO L462 AbstractCegarLoop]: Abstraction has 11128 states and 34156 transitions. [2019-12-18 18:37:37,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:37:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11128 states and 34156 transitions. [2019-12-18 18:37:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:37,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:37,892 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] [2019-12-18 18:37:37,892 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1500231249, now seen corresponding path program 6 times [2019-12-18 18:37:37,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:37,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158263124] [2019-12-18 18:37:37,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:37:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:37:37,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158263124] [2019-12-18 18:37:37,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:37:37,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:37:37,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336473587] [2019-12-18 18:37:37,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:37:37,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:37:37,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:37:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:37:37,988 INFO L87 Difference]: Start difference. First operand 11128 states and 34156 transitions. Second operand 9 states. [2019-12-18 18:37:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:37:38,657 INFO L93 Difference]: Finished difference Result 12496 states and 37532 transitions. [2019-12-18 18:37:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:37:38,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 18:37:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:37:38,680 INFO L225 Difference]: With dead ends: 12496 [2019-12-18 18:37:38,681 INFO L226 Difference]: Without dead ends: 11898 [2019-12-18 18:37:38,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:37:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11898 states. [2019-12-18 18:37:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11898 to 10798. [2019-12-18 18:37:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-18 18:37:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 33264 transitions. [2019-12-18 18:37:38,858 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 33264 transitions. Word has length 56 [2019-12-18 18:37:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:37:38,858 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 33264 transitions. [2019-12-18 18:37:38,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:37:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 33264 transitions. [2019-12-18 18:37:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:37:38,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:37:38,871 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] [2019-12-18 18:37:38,871 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:37:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:37:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 7 times [2019-12-18 18:37:38,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:37:38,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595342736] [2019-12-18 18:37:38,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:37:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:37:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:37:38,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:37:38,975 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:37:38,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2073~0.base_30|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30|) 0) (= v_~x$r_buff0_thd1~0_362 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| 4)) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30|) |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0))) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30| 1) |v_#valid_64|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2073~0.offset=|v_ULTIMATE.start_main_~#t2073~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2073~0.base=|v_ULTIMATE.start_main_~#t2073~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2075~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2075~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2073~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2074~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2074~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t2073~0.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:37:38,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10|) |v_ULTIMATE.start_main_~#t2074~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2074~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2074~0.base_10|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2074~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_9|, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2074~0.offset, ULTIMATE.start_main_~#t2074~0.base] because there is no mapped edge [2019-12-18 18:37:38,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:37:38,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11|) |v_ULTIMATE.start_main_~#t2075~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2075~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2075~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2075~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2075~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2075~0.offset] because there is no mapped edge [2019-12-18 18:37:38,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1665313662 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1665313662 256) 0))) (or (and (= ~x$w_buff1~0_In-1665313662 |P2Thread1of1ForFork1_#t~ite32_Out-1665313662|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1665313662| ~x~0_In-1665313662) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1665313662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665313662, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1665313662, ~x~0=~x~0_In-1665313662} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1665313662|, ~x$w_buff1~0=~x$w_buff1~0_In-1665313662, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665313662, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1665313662, ~x~0=~x~0_In-1665313662} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:37:38,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:37:38,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-879686955 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-879686955 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-879686955| 0)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-879686955| ~x$w_buff0_used~0_In-879686955) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-879686955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-879686955} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-879686955|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-879686955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-879686955} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:37:38,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1470054923 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1470054923 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1470054923| ~x$w_buff0_used~0_In-1470054923) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1470054923| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1470054923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470054923} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1470054923, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1470054923|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470054923} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:37:38,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-326555918 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-326555918 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-326555918 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-326555918 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-326555918| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-326555918| ~x$w_buff1_used~0_In-326555918) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-326555918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-326555918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-326555918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-326555918} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-326555918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-326555918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-326555918, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-326555918|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-326555918} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:37:38,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In654679235 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In654679235 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out654679235 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out654679235 ~x$r_buff0_thd2~0_In654679235)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In654679235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654679235} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out654679235|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out654679235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In654679235} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:37:38,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-260803146 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-260803146 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-260803146 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-260803146 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-260803146| ~x$r_buff1_thd2~0_In-260803146) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-260803146| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-260803146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-260803146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-260803146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-260803146} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-260803146|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-260803146, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-260803146, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-260803146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-260803146} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:37:38,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:37:38,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874358682 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In1874358682| |P0Thread1of1ForFork2_#t~ite8_Out1874358682|) (= ~x$w_buff0~0_In1874358682 |P0Thread1of1ForFork2_#t~ite9_Out1874358682|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1874358682 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1874358682 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1874358682 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1874358682 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out1874358682| ~x$w_buff0~0_In1874358682) (= |P0Thread1of1ForFork2_#t~ite8_Out1874358682| |P0Thread1of1ForFork2_#t~ite9_Out1874358682|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1874358682, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874358682, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1874358682|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874358682, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874358682, ~weak$$choice2~0=~weak$$choice2~0_In1874358682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874358682} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1874358682, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874358682, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1874358682|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874358682, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1874358682|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874358682, ~weak$$choice2~0=~weak$$choice2~0_In1874358682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874358682} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 18:37:38,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1522057377 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1522057377 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1522057377 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1522057377 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1522057377| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1522057377| ~x$w_buff1_used~0_In-1522057377) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1522057377, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1522057377, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1522057377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1522057377} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1522057377|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1522057377, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1522057377, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1522057377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1522057377} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:37:38,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1232868708 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1232868708 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1232868708|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-1232868708 |P2Thread1of1ForFork1_#t~ite36_Out-1232868708|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232868708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232868708} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1232868708|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1232868708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232868708} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:37:38,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In86714172 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In86714172 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In86714172 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In86714172 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out86714172| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In86714172 |P2Thread1of1ForFork1_#t~ite37_Out86714172|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In86714172, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In86714172, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In86714172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86714172} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out86714172|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In86714172, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In86714172, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In86714172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86714172} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:37:38,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:37:38,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2075402778 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out2075402778| |P0Thread1of1ForFork2_#t~ite18_Out2075402778|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In2075402778 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In2075402778 256))) (= 0 (mod ~x$w_buff0_used~0_In2075402778 256)) (and (= 0 (mod ~x$w_buff1_used~0_In2075402778 256)) .cse0))) .cse1 (= ~x$w_buff1_used~0_In2075402778 |P0Thread1of1ForFork2_#t~ite17_Out2075402778|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In2075402778| |P0Thread1of1ForFork2_#t~ite17_Out2075402778|) (not .cse1) (= ~x$w_buff1_used~0_In2075402778 |P0Thread1of1ForFork2_#t~ite18_Out2075402778|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2075402778, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In2075402778|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2075402778, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2075402778, ~weak$$choice2~0=~weak$$choice2~0_In2075402778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075402778} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2075402778, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out2075402778|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out2075402778|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2075402778, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2075402778, ~weak$$choice2~0=~weak$$choice2~0_In2075402778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075402778} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:37:38,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:37:38,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-829551561 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-829551561| ~x$r_buff1_thd1~0_In-829551561) (= |P0Thread1of1ForFork2_#t~ite23_In-829551561| |P0Thread1of1ForFork2_#t~ite23_Out-829551561|) (not .cse0)) (and (= ~x$r_buff1_thd1~0_In-829551561 |P0Thread1of1ForFork2_#t~ite23_Out-829551561|) (= |P0Thread1of1ForFork2_#t~ite24_Out-829551561| |P0Thread1of1ForFork2_#t~ite23_Out-829551561|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-829551561 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-829551561 256))) (= 0 (mod ~x$w_buff0_used~0_In-829551561 256)) (and (= (mod ~x$r_buff1_thd1~0_In-829551561 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829551561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-829551561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-829551561, ~weak$$choice2~0=~weak$$choice2~0_In-829551561, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-829551561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829551561} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829551561, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-829551561, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-829551561, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-829551561|, ~weak$$choice2~0=~weak$$choice2~0_In-829551561, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-829551561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829551561} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 18:37:38,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:37:39,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:37:39,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1908537782 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1908537782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1908537782| ~x~0_In1908537782) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1908537782 |ULTIMATE.start_main_#t~ite41_Out1908537782|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1908537782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1908537782, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1908537782, ~x~0=~x~0_In1908537782} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1908537782|, ~x$w_buff1~0=~x$w_buff1~0_In1908537782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1908537782, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1908537782, ~x~0=~x~0_In1908537782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:37:39,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:37:39,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-144353302 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-144353302 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-144353302| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-144353302| ~x$w_buff0_used~0_In-144353302) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-144353302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-144353302} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-144353302, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-144353302|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-144353302} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:37:39,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1525649685 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1525649685 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1525649685 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1525649685 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1525649685|)) (and (= ~x$w_buff1_used~0_In-1525649685 |ULTIMATE.start_main_#t~ite44_Out-1525649685|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1525649685, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1525649685, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1525649685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1525649685} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1525649685, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1525649685, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1525649685, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1525649685|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1525649685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:37:39,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1604028661 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1604028661 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1604028661| ~x$r_buff0_thd0~0_In1604028661) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1604028661| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1604028661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1604028661} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1604028661, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1604028661|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1604028661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:37:39,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1103817748 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1103817748 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1103817748 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1103817748 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1103817748 |ULTIMATE.start_main_#t~ite46_Out-1103817748|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1103817748|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1103817748, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1103817748, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1103817748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1103817748} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1103817748, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1103817748|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1103817748, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1103817748, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1103817748} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:37:39,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:37:39,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:37:39 BasicIcfg [2019-12-18 18:37:39,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:37:39,094 INFO L168 Benchmark]: Toolchain (without parser) took 176233.10 ms. Allocated memory was 144.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,095 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.96 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 152.9 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,096 INFO L168 Benchmark]: Boogie Preprocessor took 40.15 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,096 INFO L168 Benchmark]: RCFGBuilder took 930.08 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,097 INFO L168 Benchmark]: TraceAbstraction took 174375.14 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:37:39,104 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.96 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 152.9 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.15 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 930.08 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174375.14 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 174.0s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 60.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4906 SDtfs, 9199 SDslu, 16361 SDs, 0 SdLazy, 13628 SolverSat, 537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 38 SyntacticMatches, 19 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 186646 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 209772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...