/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:59:51,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:59:51,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:59:51,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:59:51,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:59:51,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:59:51,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:59:51,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:59:51,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:59:51,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:59:51,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:59:51,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:59:51,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:59:51,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:59:51,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:59:51,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:59:51,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:59:51,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:59:51,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:59:51,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:59:51,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:59:51,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:59:51,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:59:51,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:59:51,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:59:51,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:59:51,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:59:51,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:59:51,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:59:51,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:59:51,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:59:51,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:59:51,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:59:51,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:59:51,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:59:51,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:59:51,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:59:51,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:59:51,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:59:51,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:59:51,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:59:51,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:59:51,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:59:51,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:59:51,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:59:51,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:59:51,685 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:59:51,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:59:51,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:59:51,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:59:51,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:59:51,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:59:51,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:59:51,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:59:51,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:59:51,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:59:51,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:59:51,688 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:59:51,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:59:51,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:59:51,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:59:51,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:59:51,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:59:51,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:59:51,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:59:51,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:59:51,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:59:51,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:59:51,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:59:51,691 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:59:51,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:59:51,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:59:51,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:59:51,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:59:51,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:59:51,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:59:51,969 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:59:51,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2019-12-27 06:59:52,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e7b6ad41/8433eb64a2f943c0b3dbb1f189c33cbc/FLAG7d975f9cb [2019-12-27 06:59:52,571 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:59:52,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2019-12-27 06:59:52,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e7b6ad41/8433eb64a2f943c0b3dbb1f189c33cbc/FLAG7d975f9cb [2019-12-27 06:59:52,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e7b6ad41/8433eb64a2f943c0b3dbb1f189c33cbc [2019-12-27 06:59:52,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:59:52,804 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:59:52,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:59:52,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:59:52,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:59:52,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:59:52" (1/1) ... [2019-12-27 06:59:52,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58700a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:52, skipping insertion in model container [2019-12-27 06:59:52,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:59:52" (1/1) ... [2019-12-27 06:59:52,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:59:52,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:59:53,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:59:53,396 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:59:53,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:59:53,595 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:59:53,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53 WrapperNode [2019-12-27 06:59:53,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:59:53,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:59:53,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:59:53,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:59:53,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:59:53,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:59:53,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:59:53,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:59:53,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (1/1) ... [2019-12-27 06:59:53,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:59:53,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:59:53,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:59:53,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:59:53,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (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 06:59:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:59:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:59:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:59:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:59:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:59:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:59:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:59:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:59:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:59:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:59:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:59:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:59:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:59:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:59:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:59:53,790 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 06:59:54,527 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:59:54,527 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:59:54,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:59:54 BoogieIcfgContainer [2019-12-27 06:59:54,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:59:54,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:59:54,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:59:54,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:59:54,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:59:52" (1/3) ... [2019-12-27 06:59:54,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358bcd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:59:54, skipping insertion in model container [2019-12-27 06:59:54,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:59:53" (2/3) ... [2019-12-27 06:59:54,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358bcd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:59:54, skipping insertion in model container [2019-12-27 06:59:54,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:59:54" (3/3) ... [2019-12-27 06:59:54,538 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2019-12-27 06:59:54,546 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:59:54,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:59:54,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:59:54,555 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:59:54,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,597 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,597 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,621 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,621 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,621 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,622 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,622 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,640 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,640 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,642 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,643 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,644 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:59:54,666 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:59:54,682 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:59:54,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:59:54,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:59:54,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:59:54,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:59:54,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:59:54,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:59:54,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:59:54,705 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-27 06:59:54,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 06:59:54,806 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 06:59:54,806 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:59:54,822 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:59:54,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 06:59:54,893 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 06:59:54,893 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:59:54,899 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:59:54,914 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:59:54,916 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:59:58,424 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:59:58,551 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:59:58,576 INFO L206 etLargeBlockEncoding]: Checked pairs total: 58917 [2019-12-27 06:59:58,577 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 06:59:58,581 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 07:00:01,001 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35998 states. [2019-12-27 07:00:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 35998 states. [2019-12-27 07:00:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 07:00:01,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:01,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:01,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash 457272598, now seen corresponding path program 1 times [2019-12-27 07:00:01,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:01,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443911386] [2019-12-27 07:00:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:01,349 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 07:00:01,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443911386] [2019-12-27 07:00:01,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:01,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:00:01,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224996732] [2019-12-27 07:00:01,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:00:01,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:00:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:00:01,380 INFO L87 Difference]: Start difference. First operand 35998 states. Second operand 3 states. [2019-12-27 07:00:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:02,799 INFO L93 Difference]: Finished difference Result 35638 states and 152392 transitions. [2019-12-27 07:00:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:00:02,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 07:00:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:03,056 INFO L225 Difference]: With dead ends: 35638 [2019-12-27 07:00:03,056 INFO L226 Difference]: Without dead ends: 34962 [2019-12-27 07:00:03,057 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 07:00:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34962 states. [2019-12-27 07:00:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34962 to 34962. [2019-12-27 07:00:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34962 states. [2019-12-27 07:00:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34962 states to 34962 states and 149636 transitions. [2019-12-27 07:00:05,014 INFO L78 Accepts]: Start accepts. Automaton has 34962 states and 149636 transitions. Word has length 9 [2019-12-27 07:00:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:05,016 INFO L462 AbstractCegarLoop]: Abstraction has 34962 states and 149636 transitions. [2019-12-27 07:00:05,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:00:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34962 states and 149636 transitions. [2019-12-27 07:00:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 07:00:05,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:05,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:05,023 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1803558014, now seen corresponding path program 1 times [2019-12-27 07:00:05,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:05,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978633763] [2019-12-27 07:00:05,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:05,109 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 07:00:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978633763] [2019-12-27 07:00:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:00:05,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796991409] [2019-12-27 07:00:05,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:00:05,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:00:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:00:05,113 INFO L87 Difference]: Start difference. First operand 34962 states and 149636 transitions. Second operand 4 states. [2019-12-27 07:00:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:07,454 INFO L93 Difference]: Finished difference Result 55534 states and 228696 transitions. [2019-12-27 07:00:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:00:07,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 07:00:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:07,694 INFO L225 Difference]: With dead ends: 55534 [2019-12-27 07:00:07,694 INFO L226 Difference]: Without dead ends: 55506 [2019-12-27 07:00:07,695 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 07:00:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55506 states. [2019-12-27 07:00:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55506 to 50378. [2019-12-27 07:00:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50378 states. [2019-12-27 07:00:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50378 states to 50378 states and 209880 transitions. [2019-12-27 07:00:09,957 INFO L78 Accepts]: Start accepts. Automaton has 50378 states and 209880 transitions. Word has length 15 [2019-12-27 07:00:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:09,957 INFO L462 AbstractCegarLoop]: Abstraction has 50378 states and 209880 transitions. [2019-12-27 07:00:09,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:00:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 50378 states and 209880 transitions. [2019-12-27 07:00:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 07:00:09,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:09,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:09,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1993549202, now seen corresponding path program 1 times [2019-12-27 07:00:09,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:09,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731673735] [2019-12-27 07:00:09,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:10,009 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 07:00:10,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731673735] [2019-12-27 07:00:10,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:10,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:00:10,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228555751] [2019-12-27 07:00:10,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:00:10,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:00:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:00:10,011 INFO L87 Difference]: Start difference. First operand 50378 states and 209880 transitions. Second operand 3 states. [2019-12-27 07:00:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:11,998 INFO L93 Difference]: Finished difference Result 39514 states and 152165 transitions. [2019-12-27 07:00:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:00:11,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 07:00:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:12,137 INFO L225 Difference]: With dead ends: 39514 [2019-12-27 07:00:12,137 INFO L226 Difference]: Without dead ends: 39514 [2019-12-27 07:00:12,139 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 07:00:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39514 states. [2019-12-27 07:00:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39514 to 39514. [2019-12-27 07:00:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39514 states. [2019-12-27 07:00:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39514 states to 39514 states and 152165 transitions. [2019-12-27 07:00:13,489 INFO L78 Accepts]: Start accepts. Automaton has 39514 states and 152165 transitions. Word has length 15 [2019-12-27 07:00:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:13,490 INFO L462 AbstractCegarLoop]: Abstraction has 39514 states and 152165 transitions. [2019-12-27 07:00:13,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:00:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39514 states and 152165 transitions. [2019-12-27 07:00:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:00:13,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:13,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:13,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1287515706, now seen corresponding path program 1 times [2019-12-27 07:00:13,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:13,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222555752] [2019-12-27 07:00:13,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:13,567 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 07:00:13,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222555752] [2019-12-27 07:00:13,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:13,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:00:13,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922034839] [2019-12-27 07:00:13,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:00:13,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:00:13,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:00:13,570 INFO L87 Difference]: Start difference. First operand 39514 states and 152165 transitions. Second operand 4 states. [2019-12-27 07:00:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:13,637 INFO L93 Difference]: Finished difference Result 16395 states and 52415 transitions. [2019-12-27 07:00:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:00:13,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 07:00:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:13,667 INFO L225 Difference]: With dead ends: 16395 [2019-12-27 07:00:13,668 INFO L226 Difference]: Without dead ends: 16395 [2019-12-27 07:00:13,668 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 07:00:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2019-12-27 07:00:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2019-12-27 07:00:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16395 states. [2019-12-27 07:00:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 52415 transitions. [2019-12-27 07:00:14,068 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 52415 transitions. Word has length 16 [2019-12-27 07:00:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:14,069 INFO L462 AbstractCegarLoop]: Abstraction has 16395 states and 52415 transitions. [2019-12-27 07:00:14,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:00:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 52415 transitions. [2019-12-27 07:00:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:00:14,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:14,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:14,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -100090776, now seen corresponding path program 1 times [2019-12-27 07:00:14,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:14,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591289558] [2019-12-27 07:00:14,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:14,168 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 07:00:14,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591289558] [2019-12-27 07:00:14,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:14,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:00:14,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811847818] [2019-12-27 07:00:14,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:00:14,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:00:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:00:14,171 INFO L87 Difference]: Start difference. First operand 16395 states and 52415 transitions. Second operand 5 states. [2019-12-27 07:00:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:14,216 INFO L93 Difference]: Finished difference Result 2704 states and 6964 transitions. [2019-12-27 07:00:14,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:00:14,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:00:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:14,222 INFO L225 Difference]: With dead ends: 2704 [2019-12-27 07:00:14,222 INFO L226 Difference]: Without dead ends: 2704 [2019-12-27 07:00:14,222 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 07:00:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-12-27 07:00:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2019-12-27 07:00:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2019-12-27 07:00:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 6964 transitions. [2019-12-27 07:00:14,426 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 6964 transitions. Word has length 17 [2019-12-27 07:00:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:14,427 INFO L462 AbstractCegarLoop]: Abstraction has 2704 states and 6964 transitions. [2019-12-27 07:00:14,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:00:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 6964 transitions. [2019-12-27 07:00:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 07:00:14,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:14,431 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] [2019-12-27 07:00:14,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash -482532130, now seen corresponding path program 1 times [2019-12-27 07:00:14,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:14,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728315766] [2019-12-27 07:00:14,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:14,509 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 07:00:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728315766] [2019-12-27 07:00:14,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:14,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:00:14,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149072132] [2019-12-27 07:00:14,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:00:14,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:00:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:00:14,511 INFO L87 Difference]: Start difference. First operand 2704 states and 6964 transitions. Second operand 6 states. [2019-12-27 07:00:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:14,560 INFO L93 Difference]: Finished difference Result 1223 states and 3488 transitions. [2019-12-27 07:00:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:00:14,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 07:00:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:14,563 INFO L225 Difference]: With dead ends: 1223 [2019-12-27 07:00:14,563 INFO L226 Difference]: Without dead ends: 1223 [2019-12-27 07:00:14,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:00:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-27 07:00:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1111. [2019-12-27 07:00:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 07:00:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3168 transitions. [2019-12-27 07:00:14,581 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3168 transitions. Word has length 29 [2019-12-27 07:00:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:14,582 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 3168 transitions. [2019-12-27 07:00:14,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:00:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3168 transitions. [2019-12-27 07:00:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:00:14,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:14,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:14,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1094731044, now seen corresponding path program 1 times [2019-12-27 07:00:14,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:14,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548532842] [2019-12-27 07:00:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:14,699 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 07:00:14,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548532842] [2019-12-27 07:00:14,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:14,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:00:14,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973937036] [2019-12-27 07:00:14,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:00:14,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:00:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:00:14,701 INFO L87 Difference]: Start difference. First operand 1111 states and 3168 transitions. Second operand 3 states. [2019-12-27 07:00:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:14,770 INFO L93 Difference]: Finished difference Result 1121 states and 3183 transitions. [2019-12-27 07:00:14,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:00:14,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 07:00:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:14,773 INFO L225 Difference]: With dead ends: 1121 [2019-12-27 07:00:14,774 INFO L226 Difference]: Without dead ends: 1121 [2019-12-27 07:00:14,774 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 07:00:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-27 07:00:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1115. [2019-12-27 07:00:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-12-27 07:00:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 3176 transitions. [2019-12-27 07:00:14,792 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 3176 transitions. Word has length 58 [2019-12-27 07:00:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:14,793 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 3176 transitions. [2019-12-27 07:00:14,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:00:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 3176 transitions. [2019-12-27 07:00:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:00:14,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:14,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:14,798 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1612657560, now seen corresponding path program 1 times [2019-12-27 07:00:14,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:14,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329542245] [2019-12-27 07:00:14,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:14,908 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 07:00:14,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329542245] [2019-12-27 07:00:14,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:14,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:00:14,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568991289] [2019-12-27 07:00:14,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:00:14,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:00:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:00:14,910 INFO L87 Difference]: Start difference. First operand 1115 states and 3176 transitions. Second operand 5 states. [2019-12-27 07:00:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:15,152 INFO L93 Difference]: Finished difference Result 1624 states and 4614 transitions. [2019-12-27 07:00:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:00:15,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 07:00:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:15,155 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 07:00:15,156 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 07:00:15,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:00:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 07:00:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1211. [2019-12-27 07:00:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-12-27 07:00:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 3464 transitions. [2019-12-27 07:00:15,173 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 3464 transitions. Word has length 58 [2019-12-27 07:00:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:15,173 INFO L462 AbstractCegarLoop]: Abstraction has 1211 states and 3464 transitions. [2019-12-27 07:00:15,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:00:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 3464 transitions. [2019-12-27 07:00:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:00:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:15,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:15,177 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 266171848, now seen corresponding path program 2 times [2019-12-27 07:00:15,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:15,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223127824] [2019-12-27 07:00:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:15,294 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 07:00:15,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223127824] [2019-12-27 07:00:15,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:15,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:00:15,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119489696] [2019-12-27 07:00:15,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:00:15,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:00:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:00:15,297 INFO L87 Difference]: Start difference. First operand 1211 states and 3464 transitions. Second operand 6 states. [2019-12-27 07:00:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:15,648 INFO L93 Difference]: Finished difference Result 1490 states and 4126 transitions. [2019-12-27 07:00:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:00:15,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 07:00:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:15,651 INFO L225 Difference]: With dead ends: 1490 [2019-12-27 07:00:15,651 INFO L226 Difference]: Without dead ends: 1490 [2019-12-27 07:00:15,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:00:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-12-27 07:00:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1267. [2019-12-27 07:00:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2019-12-27 07:00:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 3556 transitions. [2019-12-27 07:00:15,672 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 3556 transitions. Word has length 58 [2019-12-27 07:00:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:15,673 INFO L462 AbstractCegarLoop]: Abstraction has 1267 states and 3556 transitions. [2019-12-27 07:00:15,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:00:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 3556 transitions. [2019-12-27 07:00:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:00:15,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:15,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:15,677 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1331651548, now seen corresponding path program 3 times [2019-12-27 07:00:15,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:15,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633900869] [2019-12-27 07:00:15,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:15,742 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 07:00:15,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633900869] [2019-12-27 07:00:15,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:15,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:00:15,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160238783] [2019-12-27 07:00:15,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:00:15,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:00:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:00:15,744 INFO L87 Difference]: Start difference. First operand 1267 states and 3556 transitions. Second operand 3 states. [2019-12-27 07:00:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:15,762 INFO L93 Difference]: Finished difference Result 1227 states and 3416 transitions. [2019-12-27 07:00:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:00:15,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 07:00:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:15,764 INFO L225 Difference]: With dead ends: 1227 [2019-12-27 07:00:15,765 INFO L226 Difference]: Without dead ends: 1227 [2019-12-27 07:00:15,765 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 07:00:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-27 07:00:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2019-12-27 07:00:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-12-27 07:00:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3416 transitions. [2019-12-27 07:00:15,780 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3416 transitions. Word has length 58 [2019-12-27 07:00:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:15,780 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 3416 transitions. [2019-12-27 07:00:15,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:00:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3416 transitions. [2019-12-27 07:00:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 07:00:15,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:15,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:15,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1851041935, now seen corresponding path program 1 times [2019-12-27 07:00:15,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:15,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488693936] [2019-12-27 07:00:15,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:15,870 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 07:00:15,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488693936] [2019-12-27 07:00:15,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:15,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:00:15,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9423142] [2019-12-27 07:00:15,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:00:15,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:00:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:00:15,872 INFO L87 Difference]: Start difference. First operand 1227 states and 3416 transitions. Second operand 3 states. [2019-12-27 07:00:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:15,916 INFO L93 Difference]: Finished difference Result 1226 states and 3414 transitions. [2019-12-27 07:00:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:00:15,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 07:00:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:15,918 INFO L225 Difference]: With dead ends: 1226 [2019-12-27 07:00:15,918 INFO L226 Difference]: Without dead ends: 1226 [2019-12-27 07:00:15,919 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 07:00:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2019-12-27 07:00:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 937. [2019-12-27 07:00:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 07:00:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2616 transitions. [2019-12-27 07:00:15,934 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2616 transitions. Word has length 59 [2019-12-27 07:00:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:15,934 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 2616 transitions. [2019-12-27 07:00:15,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:00:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2616 transitions. [2019-12-27 07:00:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:00:15,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:15,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:15,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -788107650, now seen corresponding path program 1 times [2019-12-27 07:00:15,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:15,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087890406] [2019-12-27 07:00:15,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:16,253 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 07:00:16,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087890406] [2019-12-27 07:00:16,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:16,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:00:16,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072052658] [2019-12-27 07:00:16,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:00:16,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:00:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:00:16,256 INFO L87 Difference]: Start difference. First operand 937 states and 2616 transitions. Second operand 12 states. [2019-12-27 07:00:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:17,644 INFO L93 Difference]: Finished difference Result 2708 states and 7174 transitions. [2019-12-27 07:00:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:00:17,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 07:00:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:17,649 INFO L225 Difference]: With dead ends: 2708 [2019-12-27 07:00:17,649 INFO L226 Difference]: Without dead ends: 1731 [2019-12-27 07:00:17,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 07:00:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-12-27 07:00:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 797. [2019-12-27 07:00:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 07:00:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2145 transitions. [2019-12-27 07:00:17,662 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 2145 transitions. Word has length 60 [2019-12-27 07:00:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:17,663 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 2145 transitions. [2019-12-27 07:00:17,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:00:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 2145 transitions. [2019-12-27 07:00:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:00:17,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:17,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:17,666 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash 90440074, now seen corresponding path program 2 times [2019-12-27 07:00:17,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:17,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087001512] [2019-12-27 07:00:17,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:17,793 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 07:00:17,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087001512] [2019-12-27 07:00:17,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:17,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:00:17,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134356450] [2019-12-27 07:00:17,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:00:17,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:00:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:00:17,796 INFO L87 Difference]: Start difference. First operand 797 states and 2145 transitions. Second operand 6 states. [2019-12-27 07:00:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:17,876 INFO L93 Difference]: Finished difference Result 1360 states and 3388 transitions. [2019-12-27 07:00:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:00:17,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 07:00:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:17,879 INFO L225 Difference]: With dead ends: 1360 [2019-12-27 07:00:17,879 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 07:00:17,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:00:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 07:00:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 576. [2019-12-27 07:00:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 07:00:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1357 transitions. [2019-12-27 07:00:17,889 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1357 transitions. Word has length 60 [2019-12-27 07:00:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:17,890 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1357 transitions. [2019-12-27 07:00:17,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:00:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1357 transitions. [2019-12-27 07:00:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:00:17,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:17,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:17,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1091007918, now seen corresponding path program 3 times [2019-12-27 07:00:17,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:17,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784939410] [2019-12-27 07:00:17,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:00:18,000 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 07:00:18,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784939410] [2019-12-27 07:00:18,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:00:18,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:00:18,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191653294] [2019-12-27 07:00:18,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:00:18,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:00:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:00:18,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:00:18,003 INFO L87 Difference]: Start difference. First operand 576 states and 1357 transitions. Second operand 5 states. [2019-12-27 07:00:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:00:18,054 INFO L93 Difference]: Finished difference Result 749 states and 1658 transitions. [2019-12-27 07:00:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:00:18,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 07:00:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:00:18,055 INFO L225 Difference]: With dead ends: 749 [2019-12-27 07:00:18,055 INFO L226 Difference]: Without dead ends: 214 [2019-12-27 07:00:18,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:00:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-27 07:00:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-12-27 07:00:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 07:00:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 369 transitions. [2019-12-27 07:00:18,059 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 369 transitions. Word has length 60 [2019-12-27 07:00:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:00:18,059 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 369 transitions. [2019-12-27 07:00:18,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:00:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 369 transitions. [2019-12-27 07:00:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:00:18,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:00:18,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:00:18,061 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:00:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:00:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1252624604, now seen corresponding path program 4 times [2019-12-27 07:00:18,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:00:18,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939658469] [2019-12-27 07:00:18,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:00:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:00:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:00:18,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:00:18,192 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:00:18,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1541~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$r_buff1_thd1~0_8 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1541~0.base_24|) (= 0 v_~z$r_buff1_thd3~0_18) (= v_~main$tmp_guard0~0_8 0) (= v_~z$r_buff0_thd2~0_10 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1541~0.base_24| 4)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_16) (= 0 |v_ULTIMATE.start_main_~#t1541~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~z$w_buff1_used~0_67) (= v_~a~0_10 0) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1541~0.base_24|)) (= v_~z$read_delayed~0_7 0) (= v_~y~0_13 0) (= 0 v_~__unbuffered_p3_EAX~0_9) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= v_~z$mem_tmp~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1541~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1541~0.base_24|) |v_ULTIMATE.start_main_~#t1541~0.offset_18| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard1~0_12 0) (= v_~z~0_29 0) (= 0 v_~z$r_buff1_thd0~0_46) (= 0 v_~z$w_buff1~0_26) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1544~0.offset=|v_ULTIMATE.start_main_~#t1544~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_18|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_10, ULTIMATE.start_main_~#t1544~0.base=|v_ULTIMATE.start_main_~#t1544~0.base_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_~#t1543~0.base=|v_ULTIMATE.start_main_~#t1543~0.base_20|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_67, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_~#t1543~0.offset=|v_ULTIMATE.start_main_~#t1543~0.offset_16|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ULTIMATE.start_main_~#t1542~0.base=|v_ULTIMATE.start_main_~#t1542~0.base_22|, ~y~0=v_~y~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ULTIMATE.start_main_~#t1542~0.offset=|v_ULTIMATE.start_main_~#t1542~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_~#t1541~0.base=|v_ULTIMATE.start_main_~#t1541~0.base_24|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_~#t1541~0.offset=|v_ULTIMATE.start_main_~#t1541~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_9|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1544~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1544~0.base, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1543~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1543~0.offset, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1542~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1542~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1541~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1541~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:00:18,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1542~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1542~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1542~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1542~0.base_10|) |v_ULTIMATE.start_main_~#t1542~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1542~0.offset_9| 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1542~0.base_10| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1542~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1542~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1542~0.offset=|v_ULTIMATE.start_main_~#t1542~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1542~0.base=|v_ULTIMATE.start_main_~#t1542~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1542~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1542~0.base] because there is no mapped edge [2019-12-27 07:00:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1543~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t1543~0.base_12|)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1543~0.base_12| 1)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1543~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1543~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1543~0.base_12|) |v_ULTIMATE.start_main_~#t1543~0.offset_10| 2)) |v_#memory_int_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1543~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1543~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1543~0.base=|v_ULTIMATE.start_main_~#t1543~0.base_12|, ULTIMATE.start_main_~#t1543~0.offset=|v_ULTIMATE.start_main_~#t1543~0.offset_10|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1543~0.base, ULTIMATE.start_main_~#t1543~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 07:00:18,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1544~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1544~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1544~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1544~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1544~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1544~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1544~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1544~0.base_11|) |v_ULTIMATE.start_main_~#t1544~0.offset_10| 3)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1544~0.base=|v_ULTIMATE.start_main_~#t1544~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1544~0.offset=|v_ULTIMATE.start_main_~#t1544~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1544~0.base, ULTIMATE.start_main_~#t1544~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 07:00:18,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_19 v_~z$w_buff1~0_17) (= v_~z$w_buff0_used~0_86 1) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= 2 v_~z$w_buff0~0_18) (= (mod v_~z$w_buff1_used~0_55 256) 0) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z$w_buff0_used~0_87 v_~z$w_buff1_used~0_55) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_19, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_55, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 07:00:18,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= 1 v_~x~0_9) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= 1 v_~a~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 07:00:18,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= 1 v_~y~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 07:00:18,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1735479452 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1735479452 256))) (.cse1 (= |P2Thread1of1ForFork1_#t~ite4_Out-1735479452| |P2Thread1of1ForFork1_#t~ite3_Out-1735479452|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-1735479452 |P2Thread1of1ForFork1_#t~ite3_Out-1735479452|) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In-1735479452 |P2Thread1of1ForFork1_#t~ite3_Out-1735479452|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1735479452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735479452, ~z$w_buff1~0=~z$w_buff1~0_In-1735479452, ~z~0=~z~0_In-1735479452} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out-1735479452|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out-1735479452|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1735479452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735479452, ~z$w_buff1~0=~z$w_buff1~0_In-1735479452, ~z~0=~z~0_In-1735479452} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 07:00:18,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1964111477 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1964111477 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite5_Out1964111477| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1964111477 |P2Thread1of1ForFork1_#t~ite5_Out1964111477|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964111477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964111477} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out1964111477|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1964111477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964111477} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 07:00:18,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-28061952 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-28061952 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-28061952 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-28061952 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite6_Out-28061952|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite6_Out-28061952| ~z$w_buff1_used~0_In-28061952) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-28061952, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-28061952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28061952, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-28061952} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out-28061952|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-28061952, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-28061952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28061952, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-28061952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 07:00:18,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1522798897 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1522798897 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In1522798897 |P2Thread1of1ForFork1_#t~ite7_Out1522798897|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite7_Out1522798897|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522798897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1522798897} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out1522798897|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1522798897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1522798897} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 07:00:18,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-988259342 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-988259342 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-988259342 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-988259342 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite8_Out-988259342| ~z$r_buff1_thd3~0_In-988259342)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out-988259342| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-988259342, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-988259342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988259342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-988259342} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-988259342, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-988259342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988259342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-988259342, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-988259342|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 07:00:18,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite8_8| v_~z$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_8|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 07:00:18,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1219370829 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1219370829 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite11_Out-1219370829|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1219370829 |P3Thread1of1ForFork2_#t~ite11_Out-1219370829|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219370829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1219370829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219370829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1219370829, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-1219370829|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:00:18,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-1540776012 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1540776012 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1540776012 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1540776012 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite12_Out-1540776012| ~z$w_buff1_used~0_In-1540776012) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite12_Out-1540776012|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1540776012, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1540776012, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1540776012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1540776012} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1540776012, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1540776012, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1540776012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1540776012, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out-1540776012|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 07:00:18,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1109304339 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1109304339 256) 0))) (or (and (= ~z$r_buff0_thd4~0_In-1109304339 ~z$r_buff0_thd4~0_Out-1109304339) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1109304339) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1109304339} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out-1109304339|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1109304339} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 07:00:18,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-181270174 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-181270174 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-181270174 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-181270174 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-181270174 |P3Thread1of1ForFork2_#t~ite14_Out-181270174|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite14_Out-181270174|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-181270174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-181270174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-181270174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181270174} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-181270174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-181270174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-181270174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181270174, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-181270174|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:00:18,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L802-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_7|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:00:18,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 07:00:18,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1321677758 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1321677758 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1321677758| ~z$w_buff1~0_In-1321677758)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1321677758| ~z~0_In-1321677758)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1321677758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1321677758, ~z$w_buff1~0=~z$w_buff1~0_In-1321677758, ~z~0=~z~0_In-1321677758} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1321677758|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1321677758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1321677758, ~z$w_buff1~0=~z$w_buff1~0_In-1321677758, ~z~0=~z~0_In-1321677758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:00:18,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:00:18,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In811517685 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In811517685 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out811517685| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out811517685| ~z$w_buff0_used~0_In811517685)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In811517685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811517685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In811517685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811517685, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out811517685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:00:18,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In388838575 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In388838575 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In388838575 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In388838575 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out388838575| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out388838575| ~z$w_buff1_used~0_In388838575) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388838575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388838575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388838575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388838575} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388838575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388838575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388838575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388838575, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out388838575|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:00:18,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1879486890 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1879486890 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1879486890|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1879486890 |ULTIMATE.start_main_#t~ite23_Out-1879486890|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1879486890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879486890} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1879486890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879486890, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1879486890|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 07:00:18,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-672742980 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-672742980 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-672742980 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-672742980 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-672742980 |ULTIMATE.start_main_#t~ite24_Out-672742980|)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-672742980|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-672742980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-672742980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-672742980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-672742980} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-672742980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-672742980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-672742980, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-672742980|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-672742980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 07:00:18,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:00:18,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1134667855 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_In-1134667855| |ULTIMATE.start_main_#t~ite45_Out-1134667855|) (= |ULTIMATE.start_main_#t~ite46_Out-1134667855| ~z$r_buff1_thd0~0_In-1134667855) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1134667855| |ULTIMATE.start_main_#t~ite45_Out-1134667855|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1134667855 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1134667855 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1134667855 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1134667855 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out-1134667855| ~z$r_buff1_thd0~0_In-1134667855) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1134667855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134667855, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1134667855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1134667855, ~weak$$choice2~0=~weak$$choice2~0_In-1134667855, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1134667855|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1134667855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134667855, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1134667855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1134667855, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1134667855|, ~weak$$choice2~0=~weak$$choice2~0_In-1134667855, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1134667855|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:00:18,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L852-->L855-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= v_~z~0_24 v_~z$mem_tmp~0_7) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:00:18,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:00:18,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:00:18 BasicIcfg [2019-12-27 07:00:18,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:00:18,376 INFO L168 Benchmark]: Toolchain (without parser) took 25572.49 ms. Allocated memory was 146.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.0 MB in the beginning and 874.5 MB in the end (delta: -772.5 MB). Peak memory consumption was 531.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,377 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.53 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.98 ms. Allocated memory is still 205.0 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,379 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,380 INFO L168 Benchmark]: RCFGBuilder took 824.91 ms. Allocated memory is still 205.0 MB. Free memory was 151.7 MB in the beginning and 103.2 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,380 INFO L168 Benchmark]: TraceAbstraction took 23844.08 ms. Allocated memory was 205.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 102.6 MB in the beginning and 874.5 MB in the end (delta: -771.9 MB). Peak memory consumption was 473.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:00:18,384 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 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.53 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.98 ms. Allocated memory is still 205.0 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.91 ms. Allocated memory is still 205.0 MB. Free memory was 151.7 MB in the beginning and 103.2 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23844.08 ms. Allocated memory was 205.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 102.6 MB in the beginning and 874.5 MB in the end (delta: -771.9 MB). Peak memory consumption was 473.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 206 TransitionsBefore, 102 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 58917 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1577 SDtfs, 1605 SDslu, 3172 SDs, 0 SdLazy, 1612 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50378occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 7267 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 84961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...