/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:23:34,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:23:34,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:23:34,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:23:34,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:23:34,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:23:34,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:23:34,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:23:34,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:23:34,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:23:34,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:23:34,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:23:34,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:23:34,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:23:34,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:23:34,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:23:34,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:23:34,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:23:34,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:23:34,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:23:34,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:23:34,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:23:34,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:23:34,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:23:34,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:23:34,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:23:34,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:23:34,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:23:34,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:23:34,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:23:34,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:23:34,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:23:34,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:23:34,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:23:34,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:23:34,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:23:34,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:23:34,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:23:34,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:23:34,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:23:34,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:23:34,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:23:34,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:23:34,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:23:34,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:23:34,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:23:34,640 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:23:34,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:23:34,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:23:34,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:23:34,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:23:34,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:23:34,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:23:34,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:23:34,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:23:34,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:23:34,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:23:34,644 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:23:34,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:23:34,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:23:34,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:23:34,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:23:34,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:23:34,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:23:34,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:23:34,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:23:34,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:23:34,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:23:34,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:23:34,647 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:23:34,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:23:34,651 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:23:34,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:23:34,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:23:34,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:23:34,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:23:34,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:23:34,967 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:23:34,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 16:23:35,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6682bc055/f577e54481e443b48df5056c6346999b/FLAG84aa7e1a1 [2019-12-27 16:23:35,642 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:23:35,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 16:23:35,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6682bc055/f577e54481e443b48df5056c6346999b/FLAG84aa7e1a1 [2019-12-27 16:23:35,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6682bc055/f577e54481e443b48df5056c6346999b [2019-12-27 16:23:35,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:23:35,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:23:35,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:23:35,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:23:35,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:23:35,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:23:35" (1/1) ... [2019-12-27 16:23:35,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e71c5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:35, skipping insertion in model container [2019-12-27 16:23:35,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:23:35" (1/1) ... [2019-12-27 16:23:35,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:23:35,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:23:36,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:23:36,491 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:23:36,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:23:36,680 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:23:36,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36 WrapperNode [2019-12-27 16:23:36,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:23:36,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:23:36,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:23:36,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:23:36,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:23:36,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:23:36,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:23:36,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:23:36,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... [2019-12-27 16:23:36,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:23:36,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:23:36,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:23:36,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:23:36,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:23:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:23:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:23:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:23:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:23:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:23:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:23:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:23:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:23:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:23:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:23:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:23:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:23:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:23:36,864 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:23:37,608 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:23:37,608 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:23:37,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:23:37 BoogieIcfgContainer [2019-12-27 16:23:37,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:23:37,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:23:37,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:23:37,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:23:37,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:23:35" (1/3) ... [2019-12-27 16:23:37,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e0bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:23:37, skipping insertion in model container [2019-12-27 16:23:37,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:36" (2/3) ... [2019-12-27 16:23:37,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e0bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:23:37, skipping insertion in model container [2019-12-27 16:23:37,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:23:37" (3/3) ... [2019-12-27 16:23:37,619 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-27 16:23:37,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:23:37,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:23:37,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:23:37,643 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:23:37,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,784 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,784 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:37,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:23:37,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:23:37,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:23:37,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:23:37,823 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:23:37,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:23:37,824 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:23:37,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:23:37,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:23:37,848 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 16:23:37,850 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 16:23:37,948 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 16:23:37,948 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:23:37,963 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:23:37,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 16:23:38,038 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 16:23:38,039 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:23:38,046 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:23:38,065 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 16:23:38,066 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:23:43,740 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:23:43,894 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:23:43,910 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-27 16:23:43,910 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:23:43,913 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 16:23:54,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 16:23:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 16:23:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:23:54,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:23:54,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:23:54,051 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:23:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:23:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-27 16:23:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:23:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596462767] [2019-12-27 16:23:54,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:23:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:23:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:23:54,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596462767] [2019-12-27 16:23:54,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:23:54,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:23:54,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1201395241] [2019-12-27 16:23:54,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:23:54,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:23:54,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:23:54,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:23:54,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:23:54,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:23:54,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:23:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:23:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:23:54,408 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 16:23:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:23:56,912 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 16:23:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:23:56,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:23:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:23:57,465 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 16:23:57,465 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 16:23:57,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 16:24:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 16:24:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 16:24:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 16:24:04,737 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 16:24:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:04,738 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 16:24:04,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 16:24:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:24:04,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:04,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:04,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-27 16:24:04,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:04,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390262243] [2019-12-27 16:24:04,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:04,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390262243] [2019-12-27 16:24:04,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:04,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:04,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724701386] [2019-12-27 16:24:04,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:04,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:04,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:24:04,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:04,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:04,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:04,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:04,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:04,858 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 16:24:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:07,834 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 16:24:07,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:07,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:24:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:07,898 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 16:24:07,898 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 16:24:07,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 16:24:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 16:24:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 16:24:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 16:24:08,415 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 16:24:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:08,416 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 16:24:08,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 16:24:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:24:08,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:08,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:08,418 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-27 16:24:08,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:08,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073776711] [2019-12-27 16:24:08,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:08,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073776711] [2019-12-27 16:24:08,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:08,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:08,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775144384] [2019-12-27 16:24:08,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:08,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:08,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:24:08,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:08,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:08,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:24:08,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:24:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:08,535 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 16:24:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:08,883 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 16:24:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:08,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:24:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:09,086 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 16:24:09,086 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 16:24:09,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 16:24:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 16:24:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 16:24:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 16:24:10,193 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 16:24:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:10,194 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 16:24:10,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:24:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 16:24:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:24:10,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:10,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:10,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-27 16:24:10,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:10,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159222805] [2019-12-27 16:24:10,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159222805] [2019-12-27 16:24:10,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:10,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:10,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289162444] [2019-12-27 16:24:10,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:10,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:10,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:24:10,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:10,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:24:10,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:24:10,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:24:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:10,337 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 5 states. [2019-12-27 16:24:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:10,766 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 16:24:10,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:10,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:24:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:10,857 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 16:24:10,857 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 16:24:10,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:24:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 16:24:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 16:24:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 16:24:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 16:24:11,712 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 16:24:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:11,713 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 16:24:11,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:24:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 16:24:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:24:11,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:11,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:11,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-27 16:24:11,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:11,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560625735] [2019-12-27 16:24:11,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:11,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-27 16:24:11,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560625735] [2019-12-27 16:24:11,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:11,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:11,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [242248662] [2019-12-27 16:24:11,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:11,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:11,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:24:11,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:11,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:24:11,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:24:11,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:24:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:11,790 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 5 states. [2019-12-27 16:24:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:12,379 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 16:24:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:12,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:24:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:12,448 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 16:24:12,448 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 16:24:12,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:24:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 16:24:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 16:24:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 16:24:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 16:24:13,296 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 16:24:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:13,297 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 16:24:13,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:24:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 16:24:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:24:13,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:13,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:13,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-27 16:24:13,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:13,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128821333] [2019-12-27 16:24:13,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:13,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128821333] [2019-12-27 16:24:13,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:13,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:24:13,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192260644] [2019-12-27 16:24:13,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:13,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:13,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 16:24:13,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:13,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:13,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:24:13,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:24:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:13,407 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 16:24:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:13,997 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 16:24:13,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:24:13,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:24:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:14,109 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 16:24:14,109 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 16:24:14,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:24:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 16:24:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 16:24:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 16:24:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 16:24:15,112 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 16:24:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:15,112 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 16:24:15,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:24:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 16:24:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:24:15,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:15,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:15,121 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-27 16:24:15,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:15,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519890083] [2019-12-27 16:24:15,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:15,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519890083] [2019-12-27 16:24:15,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:15,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:24:15,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387308316] [2019-12-27 16:24:15,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:15,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:15,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 16:24:15,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:15,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:24:15,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:24:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:15,227 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 16:24:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:15,797 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 16:24:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:24:15,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:24:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:15,879 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 16:24:15,880 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 16:24:15,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:24:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 16:24:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 16:24:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 16:24:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 16:24:16,801 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 16:24:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:16,801 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 16:24:16,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:24:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 16:24:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:24:16,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:16,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:16,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-27 16:24:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:16,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736173326] [2019-12-27 16:24:16,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736173326] [2019-12-27 16:24:16,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:16,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:24:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886873310] [2019-12-27 16:24:16,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:16,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:16,897 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:24:16,897 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:16,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:16,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:24:16,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:24:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:16,899 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 16:24:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:16,969 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 16:24:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:24:16,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:24:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:16,986 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 16:24:16,986 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 16:24:16,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 16:24:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 16:24:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 16:24:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 16:24:17,149 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 16:24:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:17,149 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 16:24:17,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:24:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 16:24:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:24:17,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:17,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:17,164 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-27 16:24:17,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:17,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666971416] [2019-12-27 16:24:17,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:17,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666971416] [2019-12-27 16:24:17,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:17,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:24:17,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760652726] [2019-12-27 16:24:17,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:17,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:17,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 113 transitions. [2019-12-27 16:24:17,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:17,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:24:17,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:17,283 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 16:24:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:17,361 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-27 16:24:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:17,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:24:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:17,383 INFO L225 Difference]: With dead ends: 15100 [2019-12-27 16:24:17,383 INFO L226 Difference]: Without dead ends: 15100 [2019-12-27 16:24:17,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-27 16:24:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-27 16:24:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-27 16:24:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-27 16:24:17,574 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-27 16:24:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:17,574 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-27 16:24:17,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-27 16:24:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:24:17,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:17,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:17,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-27 16:24:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:17,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344167207] [2019-12-27 16:24:17,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:17,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344167207] [2019-12-27 16:24:17,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:17,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:24:17,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324332715] [2019-12-27 16:24:17,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:17,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:17,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 113 transitions. [2019-12-27 16:24:17,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:17,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:17,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:24:17,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:24:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:17,711 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-27 16:24:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:17,803 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-27 16:24:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:17,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 16:24:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:17,828 INFO L225 Difference]: With dead ends: 11017 [2019-12-27 16:24:17,829 INFO L226 Difference]: Without dead ends: 11017 [2019-12-27 16:24:17,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-27 16:24:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-27 16:24:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 16:24:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 16:24:18,288 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-27 16:24:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:18,288 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 16:24:18,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:24:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 16:24:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:18,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:18,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:18,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-27 16:24:18,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:18,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187237892] [2019-12-27 16:24:18,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:18,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187237892] [2019-12-27 16:24:18,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:18,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:24:18,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955782028] [2019-12-27 16:24:18,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:18,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:18,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 262 transitions. [2019-12-27 16:24:18,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:18,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:18,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:24:18,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:18,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:24:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:18,524 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-27 16:24:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:18,626 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-27 16:24:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:24:18,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 16:24:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:18,643 INFO L225 Difference]: With dead ends: 18723 [2019-12-27 16:24:18,644 INFO L226 Difference]: Without dead ends: 8627 [2019-12-27 16:24:18,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-27 16:24:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-27 16:24:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-27 16:24:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-27 16:24:18,790 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-27 16:24:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:18,790 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-27 16:24:18,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:24:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-27 16:24:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:18,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:18,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:18,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-27 16:24:18,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:18,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123816582] [2019-12-27 16:24:18,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:18,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123816582] [2019-12-27 16:24:18,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:18,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:24:18,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272120811] [2019-12-27 16:24:18,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:18,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:19,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 234 transitions. [2019-12-27 16:24:19,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:19,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:24:19,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:24:19,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:24:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:24:19,109 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 10 states. [2019-12-27 16:24:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:20,624 INFO L93 Difference]: Finished difference Result 35600 states and 109832 transitions. [2019-12-27 16:24:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:24:20,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 16:24:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:20,666 INFO L225 Difference]: With dead ends: 35600 [2019-12-27 16:24:20,667 INFO L226 Difference]: Without dead ends: 27341 [2019-12-27 16:24:20,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:24:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27341 states. [2019-12-27 16:24:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27341 to 10739. [2019-12-27 16:24:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-27 16:24:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-27 16:24:21,102 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-27 16:24:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:21,103 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-27 16:24:21,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:24:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-27 16:24:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:21,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:21,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:21,119 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-27 16:24:21,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:21,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820564515] [2019-12-27 16:24:21,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:21,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820564515] [2019-12-27 16:24:21,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:21,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:24:21,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019706082] [2019-12-27 16:24:21,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:21,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:21,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 333 transitions. [2019-12-27 16:24:21,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:21,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:24:21,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:24:21,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:24:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:24:21,419 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 8 states. [2019-12-27 16:24:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:21,860 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-27 16:24:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:24:21,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 16:24:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:21,891 INFO L225 Difference]: With dead ends: 29619 [2019-12-27 16:24:21,892 INFO L226 Difference]: Without dead ends: 21040 [2019-12-27 16:24:21,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:24:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-27 16:24:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-27 16:24:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-27 16:24:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-27 16:24:22,166 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-27 16:24:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:22,166 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-27 16:24:22,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:24:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-27 16:24:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:22,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:22,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:22,182 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-27 16:24:22,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:22,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379604366] [2019-12-27 16:24:22,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379604366] [2019-12-27 16:24:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:22,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:22,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810601119] [2019-12-27 16:24:22,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:22,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:22,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 288 transitions. [2019-12-27 16:24:22,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:22,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:24:22,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:22,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:22,355 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-27 16:24:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:22,416 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-27 16:24:22,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:22,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 16:24:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:22,428 INFO L225 Difference]: With dead ends: 19683 [2019-12-27 16:24:22,428 INFO L226 Difference]: Without dead ends: 6496 [2019-12-27 16:24:22,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-27 16:24:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-27 16:24:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-27 16:24:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-27 16:24:22,529 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-27 16:24:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:22,529 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-27 16:24:22,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-27 16:24:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:22,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:22,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:22,536 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-27 16:24:22,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:22,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160719122] [2019-12-27 16:24:22,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:22,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160719122] [2019-12-27 16:24:22,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:22,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:24:22,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167455913] [2019-12-27 16:24:22,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:22,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:22,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 345 transitions. [2019-12-27 16:24:22,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:23,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:24:23,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:24:23,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:24:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:24:23,024 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 10 states. [2019-12-27 16:24:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:24,472 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-27 16:24:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:24:24,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 16:24:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:24,530 INFO L225 Difference]: With dead ends: 34361 [2019-12-27 16:24:24,530 INFO L226 Difference]: Without dead ends: 27058 [2019-12-27 16:24:24,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:24:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-27 16:24:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-27 16:24:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-27 16:24:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-27 16:24:24,831 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-27 16:24:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:24,831 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-27 16:24:24,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:24:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-27 16:24:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:24,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:24,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:24,842 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:24,842 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-27 16:24:24,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:24,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047873048] [2019-12-27 16:24:24,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:24,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047873048] [2019-12-27 16:24:24,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:24,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:24:24,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111224234] [2019-12-27 16:24:24,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:24,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:25,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 16:24:25,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:25,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:24:25,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:24:25,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:24:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:24:25,418 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 12 states. [2019-12-27 16:24:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:28,412 INFO L93 Difference]: Finished difference Result 31460 states and 98569 transitions. [2019-12-27 16:24:28,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 16:24:28,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-27 16:24:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:28,459 INFO L225 Difference]: With dead ends: 31460 [2019-12-27 16:24:28,459 INFO L226 Difference]: Without dead ends: 29315 [2019-12-27 16:24:28,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 19 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=711, Invalid=2949, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 16:24:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29315 states. [2019-12-27 16:24:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29315 to 8823. [2019-12-27 16:24:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-27 16:24:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-27 16:24:28,751 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-27 16:24:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:28,751 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-27 16:24:28,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:24:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-27 16:24:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:28,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:28,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:28,763 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-27 16:24:28,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:28,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621443236] [2019-12-27 16:24:28,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:28,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621443236] [2019-12-27 16:24:28,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:28,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:24:28,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425229983] [2019-12-27 16:24:28,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:28,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:29,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 318 transitions. [2019-12-27 16:24:29,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:29,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:24:29,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:24:29,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:24:29,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:24:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:24:29,330 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 18 states. [2019-12-27 16:24:31,444 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-12-27 16:24:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:32,921 INFO L93 Difference]: Finished difference Result 17867 states and 52740 transitions. [2019-12-27 16:24:32,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 16:24:32,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-12-27 16:24:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:32,947 INFO L225 Difference]: With dead ends: 17867 [2019-12-27 16:24:32,947 INFO L226 Difference]: Without dead ends: 17783 [2019-12-27 16:24:32,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 16:24:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17783 states. [2019-12-27 16:24:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17783 to 10052. [2019-12-27 16:24:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10052 states. [2019-12-27 16:24:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10052 states to 10052 states and 30478 transitions. [2019-12-27 16:24:33,159 INFO L78 Accepts]: Start accepts. Automaton has 10052 states and 30478 transitions. Word has length 53 [2019-12-27 16:24:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:33,159 INFO L462 AbstractCegarLoop]: Abstraction has 10052 states and 30478 transitions. [2019-12-27 16:24:33,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:24:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10052 states and 30478 transitions. [2019-12-27 16:24:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:33,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:33,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:33,172 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1491786391, now seen corresponding path program 8 times [2019-12-27 16:24:33,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:33,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074385739] [2019-12-27 16:24:33,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:33,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074385739] [2019-12-27 16:24:33,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:33,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:24:33,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762123172] [2019-12-27 16:24:33,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:33,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:33,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 356 transitions. [2019-12-27 16:24:33,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:33,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:24:33,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:24:33,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:24:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:24:33,615 INFO L87 Difference]: Start difference. First operand 10052 states and 30478 transitions. Second operand 13 states. [2019-12-27 16:24:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:36,061 INFO L93 Difference]: Finished difference Result 27595 states and 79641 transitions. [2019-12-27 16:24:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:24:36,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 16:24:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:36,098 INFO L225 Difference]: With dead ends: 27595 [2019-12-27 16:24:36,099 INFO L226 Difference]: Without dead ends: 27485 [2019-12-27 16:24:36,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:24:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27485 states. [2019-12-27 16:24:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27485 to 11932. [2019-12-27 16:24:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11932 states. [2019-12-27 16:24:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11932 states to 11932 states and 35521 transitions. [2019-12-27 16:24:36,534 INFO L78 Accepts]: Start accepts. Automaton has 11932 states and 35521 transitions. Word has length 53 [2019-12-27 16:24:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:36,535 INFO L462 AbstractCegarLoop]: Abstraction has 11932 states and 35521 transitions. [2019-12-27 16:24:36,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:24:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11932 states and 35521 transitions. [2019-12-27 16:24:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:24:36,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:36,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:36,548 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1750340863, now seen corresponding path program 9 times [2019-12-27 16:24:36,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:36,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375318952] [2019-12-27 16:24:36,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:36,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375318952] [2019-12-27 16:24:36,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:36,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:36,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797273338] [2019-12-27 16:24:36,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:36,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:36,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 333 transitions. [2019-12-27 16:24:36,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:36,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:36,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:36,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:36,794 INFO L87 Difference]: Start difference. First operand 11932 states and 35521 transitions. Second operand 3 states. [2019-12-27 16:24:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:36,835 INFO L93 Difference]: Finished difference Result 11930 states and 35516 transitions. [2019-12-27 16:24:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:36,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 16:24:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:36,852 INFO L225 Difference]: With dead ends: 11930 [2019-12-27 16:24:36,852 INFO L226 Difference]: Without dead ends: 11930 [2019-12-27 16:24:36,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11930 states. [2019-12-27 16:24:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11930 to 10417. [2019-12-27 16:24:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10417 states. [2019-12-27 16:24:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10417 states to 10417 states and 31374 transitions. [2019-12-27 16:24:37,015 INFO L78 Accepts]: Start accepts. Automaton has 10417 states and 31374 transitions. Word has length 53 [2019-12-27 16:24:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:37,015 INFO L462 AbstractCegarLoop]: Abstraction has 10417 states and 31374 transitions. [2019-12-27 16:24:37,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 10417 states and 31374 transitions. [2019-12-27 16:24:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 16:24:37,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:37,027 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-27 16:24:37,027 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:37,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158321, now seen corresponding path program 1 times [2019-12-27 16:24:37,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:37,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083755436] [2019-12-27 16:24:37,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:37,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083755436] [2019-12-27 16:24:37,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:37,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:37,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934054188] [2019-12-27 16:24:37,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:37,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:37,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 319 transitions. [2019-12-27 16:24:37,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:37,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:24:37,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:24:37,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:24:37,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:37,292 INFO L87 Difference]: Start difference. First operand 10417 states and 31374 transitions. Second operand 4 states. [2019-12-27 16:24:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:37,578 INFO L93 Difference]: Finished difference Result 9599 states and 28651 transitions. [2019-12-27 16:24:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:37,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 16:24:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:37,601 INFO L225 Difference]: With dead ends: 9599 [2019-12-27 16:24:37,601 INFO L226 Difference]: Without dead ends: 9599 [2019-12-27 16:24:37,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:24:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9599 states. [2019-12-27 16:24:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9599 to 7333. [2019-12-27 16:24:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7333 states. [2019-12-27 16:24:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7333 states to 7333 states and 22049 transitions. [2019-12-27 16:24:37,851 INFO L78 Accepts]: Start accepts. Automaton has 7333 states and 22049 transitions. Word has length 54 [2019-12-27 16:24:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:37,851 INFO L462 AbstractCegarLoop]: Abstraction has 7333 states and 22049 transitions. [2019-12-27 16:24:37,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:24:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7333 states and 22049 transitions. [2019-12-27 16:24:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:24:37,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:37,862 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-27 16:24:37,863 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 404282337, now seen corresponding path program 1 times [2019-12-27 16:24:37,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439088909] [2019-12-27 16:24:37,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:37,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439088909] [2019-12-27 16:24:37,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:37,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:24:37,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470507414] [2019-12-27 16:24:37,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:38,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:38,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 276 transitions. [2019-12-27 16:24:38,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:38,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:24:38,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:24:38,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:24:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:24:38,276 INFO L87 Difference]: Start difference. First operand 7333 states and 22049 transitions. Second operand 12 states. [2019-12-27 16:24:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:39,583 INFO L93 Difference]: Finished difference Result 13618 states and 40531 transitions. [2019-12-27 16:24:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:24:39,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 16:24:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:39,598 INFO L225 Difference]: With dead ends: 13618 [2019-12-27 16:24:39,598 INFO L226 Difference]: Without dead ends: 9110 [2019-12-27 16:24:39,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:24:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9110 states. [2019-12-27 16:24:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9110 to 7675. [2019-12-27 16:24:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 16:24:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 22706 transitions. [2019-12-27 16:24:39,722 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 22706 transitions. Word has length 55 [2019-12-27 16:24:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:39,722 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 22706 transitions. [2019-12-27 16:24:39,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:24:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 22706 transitions. [2019-12-27 16:24:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:24:39,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:39,730 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-27 16:24:39,730 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 2 times [2019-12-27 16:24:39,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:39,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53079885] [2019-12-27 16:24:39,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:39,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53079885] [2019-12-27 16:24:39,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:39,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:24:39,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035551844] [2019-12-27 16:24:39,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:39,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:40,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 449 transitions. [2019-12-27 16:24:40,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:40,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:24:40,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:24:40,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:40,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:24:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:24:40,322 INFO L87 Difference]: Start difference. First operand 7675 states and 22706 transitions. Second operand 15 states. [2019-12-27 16:24:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:41,458 INFO L93 Difference]: Finished difference Result 10615 states and 30962 transitions. [2019-12-27 16:24:41,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 16:24:41,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 16:24:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:41,470 INFO L225 Difference]: With dead ends: 10615 [2019-12-27 16:24:41,470 INFO L226 Difference]: Without dead ends: 8185 [2019-12-27 16:24:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:24:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2019-12-27 16:24:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7121. [2019-12-27 16:24:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-12-27 16:24:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 21110 transitions. [2019-12-27 16:24:41,588 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 21110 transitions. Word has length 55 [2019-12-27 16:24:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:41,588 INFO L462 AbstractCegarLoop]: Abstraction has 7121 states and 21110 transitions. [2019-12-27 16:24:41,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:24:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 21110 transitions. [2019-12-27 16:24:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:24:41,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:41,597 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-27 16:24:41,597 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 3 times [2019-12-27 16:24:41,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857294666] [2019-12-27 16:24:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:24:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:24:41,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:24:41,697 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:24:41,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_28| 4)) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= |v_ULTIMATE.start_main_~#t648~0.offset_19| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) |v_ULTIMATE.start_main_~#t648~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice0~0_34) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_19|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_28|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_17|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:24:41,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:24:41,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:24:41,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1954637039 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1954637039|) (= P1Thread1of1ForFork1_~arg.base_Out-1954637039 |P1Thread1of1ForFork1_#in~arg.base_In-1954637039|) (= ~y$w_buff0~0_Out-1954637039 1) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1954637039| P1Thread1of1ForFork1_~arg.offset_Out-1954637039) (= 1 ~y$w_buff0_used~0_Out-1954637039) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1954637039|) (= ~y$w_buff1~0_Out-1954637039 ~y$w_buff0~0_In-1954637039) (= 0 (mod ~y$w_buff1_used~0_Out-1954637039 256)) (= ~y$w_buff0_used~0_In-1954637039 ~y$w_buff1_used~0_Out-1954637039)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1954637039, ~y$w_buff0~0=~y$w_buff0~0_In-1954637039, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1954637039|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1954637039|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1954637039, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1954637039, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1954637039, ~y$w_buff1~0=~y$w_buff1~0_Out-1954637039, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1954637039|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1954637039, ~y$w_buff0~0=~y$w_buff0~0_Out-1954637039, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1954637039|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1954637039|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1954637039} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:24:41,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite33_Out823438239| |P2Thread1of1ForFork2_#t~ite32_Out823438239|)) (.cse1 (= (mod ~y$w_buff1_used~0_In823438239 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In823438239 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out823438239| ~y$w_buff1~0_In823438239) (not .cse1) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out823438239| ~y~0_In823438239) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In823438239, ~y$w_buff1~0=~y$w_buff1~0_In823438239, ~y~0=~y~0_In823438239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In823438239} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In823438239, ~y$w_buff1~0=~y$w_buff1~0_In823438239, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out823438239|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out823438239|, ~y~0=~y~0_In823438239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In823438239} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 16:24:41,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-432480493 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-432480493 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-432480493| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-432480493| ~y$w_buff0_used~0_In-432480493)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-432480493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-432480493} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-432480493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-432480493, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-432480493|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 16:24:41,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1097836561 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1097836561 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1097836561|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1097836561 |P2Thread1of1ForFork2_#t~ite34_Out-1097836561|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097836561, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1097836561} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1097836561|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097836561, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1097836561} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 16:24:41,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1904795923 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1904795923 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1904795923 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1904795923 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1904795923 |P2Thread1of1ForFork2_#t~ite35_Out1904795923|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out1904795923|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1904795923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1904795923, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1904795923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1904795923} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1904795923|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1904795923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1904795923, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1904795923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1904795923} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 16:24:41,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1646124473 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1646124473 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1646124473 |P2Thread1of1ForFork2_#t~ite36_Out-1646124473|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-1646124473|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646124473, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1646124473} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1646124473|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646124473, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1646124473} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 16:24:41,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In65124726 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In65124726 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In65124726 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In65124726 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out65124726|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In65124726 |P2Thread1of1ForFork2_#t~ite37_Out65124726|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In65124726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65124726, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In65124726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65124726} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out65124726|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In65124726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65124726, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In65124726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65124726} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 16:24:41,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 16:24:41,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1577239642 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1577239642 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1577239642 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1577239642 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1577239642|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out1577239642| ~y$w_buff1_used~0_In1577239642)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577239642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577239642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577239642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577239642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1577239642, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1577239642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577239642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577239642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577239642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 16:24:41,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1693569012 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1693569012 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1693569012)) (and (= ~y$r_buff0_thd2~0_In1693569012 ~y$r_buff0_thd2~0_Out1693569012) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1693569012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1693569012} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1693569012|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1693569012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1693569012} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:24:41,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1448597936 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1448597936 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1448597936 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1448597936 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out1448597936| ~y$r_buff1_thd2~0_In1448597936)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite31_Out1448597936| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1448597936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1448597936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1448597936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1448597936} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1448597936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1448597936, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1448597936|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1448597936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1448597936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:24:41,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:24:41,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-279254780 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-279254780 256)))) (or (= (mod ~y$w_buff0_used~0_In-279254780 256) 0) (and (= (mod ~y$r_buff1_thd1~0_In-279254780 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In-279254780 256)) .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-279254780| |P0Thread1of1ForFork0_#t~ite9_Out-279254780|) .cse1 (= ~y$w_buff0~0_In-279254780 |P0Thread1of1ForFork0_#t~ite8_Out-279254780|)) (and (= ~y$w_buff0~0_In-279254780 |P0Thread1of1ForFork0_#t~ite9_Out-279254780|) (= |P0Thread1of1ForFork0_#t~ite8_In-279254780| |P0Thread1of1ForFork0_#t~ite8_Out-279254780|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-279254780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-279254780, ~y$w_buff0~0=~y$w_buff0~0_In-279254780, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-279254780, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-279254780|, ~weak$$choice2~0=~weak$$choice2~0_In-279254780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-279254780} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-279254780, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-279254780|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-279254780, ~y$w_buff0~0=~y$w_buff0~0_In-279254780, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-279254780|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-279254780, ~weak$$choice2~0=~weak$$choice2~0_In-279254780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-279254780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:24:41,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1534315639 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out-1534315639| ~y$w_buff1~0_In-1534315639) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1534315639 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1534315639 256)) (and (= (mod ~y$w_buff1_used~0_In-1534315639 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd1~0_In-1534315639 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork0_#t~ite12_Out-1534315639| |P0Thread1of1ForFork0_#t~ite11_Out-1534315639|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite11_In-1534315639| |P0Thread1of1ForFork0_#t~ite11_Out-1534315639|) (= |P0Thread1of1ForFork0_#t~ite12_Out-1534315639| ~y$w_buff1~0_In-1534315639)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1534315639|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534315639, ~y$w_buff1~0=~y$w_buff1~0_In-1534315639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534315639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534315639, ~weak$$choice2~0=~weak$$choice2~0_In-1534315639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534315639} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1534315639|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1534315639, ~y$w_buff1~0=~y$w_buff1~0_In-1534315639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1534315639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1534315639, ~weak$$choice2~0=~weak$$choice2~0_In-1534315639, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1534315639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1534315639} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:24:41,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 16:24:41,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 16:24:41,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:24:41,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1770619682 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1770619682 256) 0))) (or (and (= ~y$w_buff1~0_In1770619682 |ULTIMATE.start_main_#t~ite41_Out1770619682|) (not .cse0) (not .cse1)) (and (= ~y~0_In1770619682 |ULTIMATE.start_main_#t~ite41_Out1770619682|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1770619682, ~y~0=~y~0_In1770619682, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1770619682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770619682} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1770619682|, ~y$w_buff1~0=~y$w_buff1~0_In1770619682, ~y~0=~y~0_In1770619682, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1770619682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770619682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:24:41,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:24:41,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In588057409 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In588057409 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out588057409| ~y$w_buff0_used~0_In588057409)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out588057409| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In588057409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588057409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In588057409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In588057409, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out588057409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:24:41,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1732389904 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1732389904 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1732389904 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1732389904 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1732389904| ~y$w_buff1_used~0_In1732389904) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out1732389904| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1732389904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1732389904, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1732389904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732389904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1732389904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1732389904, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1732389904, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1732389904|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1732389904} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:24:41,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1693514853 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1693514853 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1693514853| ~y$r_buff0_thd0~0_In1693514853)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1693514853|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1693514853, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1693514853} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1693514853, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1693514853, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1693514853|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:24:41,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-647287444 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-647287444 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-647287444 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-647287444 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-647287444 |ULTIMATE.start_main_#t~ite46_Out-647287444|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-647287444|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-647287444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-647287444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-647287444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-647287444} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-647287444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-647287444, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-647287444|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-647287444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-647287444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:24:41,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, 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, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:24:41,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:24:41 BasicIcfg [2019-12-27 16:24:41,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:24:41,841 INFO L168 Benchmark]: Toolchain (without parser) took 65939.65 ms. Allocated memory was 145.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 102.2 MB in the beginning and 809.9 MB in the end (delta: -707.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,842 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.80 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 155.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,843 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,843 INFO L168 Benchmark]: RCFGBuilder took 817.09 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 102.6 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,848 INFO L168 Benchmark]: TraceAbstraction took 64228.28 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 102.6 MB in the beginning and 809.9 MB in the end (delta: -707.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:24:41,854 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.80 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 155.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.09 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 102.6 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64228.28 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 102.6 MB in the beginning and 809.9 MB in the end (delta: -707.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4189 SDtfs, 7896 SDslu, 15420 SDs, 0 SdLazy, 9453 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 141 SyntacticMatches, 55 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 140102 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 138369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...