/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:58:31,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:58:31,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:58:31,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:58:31,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:58:31,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:58:31,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:58:31,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:58:31,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:58:31,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:58:31,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:58:31,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:58:31,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:58:31,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:58:31,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:58:31,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:58:31,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:58:31,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:58:31,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:58:31,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:58:31,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:58:31,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:58:31,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:58:31,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:58:31,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:58:31,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:58:31,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:58:31,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:58:31,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:58:31,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:58:31,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:58:31,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:58:31,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:58:31,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:58:31,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:58:31,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:58:31,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:58:31,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:58:31,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:58:31,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:58:31,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:58:31,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:58:31,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:58:31,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:58:31,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:58:31,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:58:31,780 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:58:31,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:58:31,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:58:31,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:58:31,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:58:31,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:58:31,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:58:31,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:58:31,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:58:31,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:58:31,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:58:31,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:58:31,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:58:31,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:58:31,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:58:31,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:58:31,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:58:31,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:58:31,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:58:31,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:58:31,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:58:31,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:58:31,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:58:31,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:58:31,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:58:32,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:58:32,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:58:32,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:58:32,118 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:58:32,118 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:58:32,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-27 03:58:32,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b2fcaf/0a0df61eadb2416b9ebd139a950042e7/FLAGef99440db [2019-12-27 03:58:32,747 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:58:32,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-27 03:58:32,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b2fcaf/0a0df61eadb2416b9ebd139a950042e7/FLAGef99440db [2019-12-27 03:58:32,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b2fcaf/0a0df61eadb2416b9ebd139a950042e7 [2019-12-27 03:58:32,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:58:32,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:58:32,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:58:32,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:58:32,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:58:32,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:58:32" (1/1) ... [2019-12-27 03:58:32,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c448b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:32, skipping insertion in model container [2019-12-27 03:58:32,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:58:32" (1/1) ... [2019-12-27 03:58:32,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:58:33,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:58:33,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:58:33,526 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:58:33,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:58:33,673 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:58:33,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33 WrapperNode [2019-12-27 03:58:33,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:58:33,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:58:33,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:58:33,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:58:33,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:58:33,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:58:33,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:58:33,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:58:33,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (1/1) ... [2019-12-27 03:58:33,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:58:33,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:58:33,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:58:33,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:58:33,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (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 03:58:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:58:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:58:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:58:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:58:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:58:33,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:58:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:58:33,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:58:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:58:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:58:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:58:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:58:33,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:58:33,862 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 03:58:34,612 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:58:34,613 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:58:34,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:58:34 BoogieIcfgContainer [2019-12-27 03:58:34,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:58:34,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:58:34,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:58:34,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:58:34,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:58:32" (1/3) ... [2019-12-27 03:58:34,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b182ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:58:34, skipping insertion in model container [2019-12-27 03:58:34,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:33" (2/3) ... [2019-12-27 03:58:34,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b182ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:58:34, skipping insertion in model container [2019-12-27 03:58:34,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:58:34" (3/3) ... [2019-12-27 03:58:34,623 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-27 03:58:34,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:58:34,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:58:34,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:58:34,645 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:58:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,717 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,717 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,743 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,743 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,757 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,757 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:34,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:58:34,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:58:34,809 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:58:34,809 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:58:34,809 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:58:34,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:58:34,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:58:34,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:58:34,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:58:34,828 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 03:58:34,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:58:34,950 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:58:34,951 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:58:34,968 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:58:34,991 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:58:35,072 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:58:35,072 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:58:35,081 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:58:35,098 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:58:35,099 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:58:40,644 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:58:40,774 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:58:40,805 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 03:58:40,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:58:40,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 03:58:52,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 03:58:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 03:58:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:58:52,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:52,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:58:52,798 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 03:58:52,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:52,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372025040] [2019-12-27 03:58:52,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:53,160 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 03:58:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372025040] [2019-12-27 03:58:53,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:53,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:58:53,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501515606] [2019-12-27 03:58:53,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:53,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:53,189 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 03:58:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:54,251 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 03:58:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:54,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:58:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:57,302 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 03:58:57,302 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 03:58:57,304 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 03:59:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 03:59:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 03:59:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 03:59:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 03:59:06,200 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 03:59:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:06,200 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 03:59:06,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 03:59:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:59:06,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:06,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:06,215 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 03:59:06,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:06,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215178422] [2019-12-27 03:59:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:59:06,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215178422] [2019-12-27 03:59:06,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:06,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:06,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692234185] [2019-12-27 03:59:06,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:06,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:06,361 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 03:59:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:11,068 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 03:59:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:59:11,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:59:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:11,730 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 03:59:11,730 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 03:59:11,731 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 03:59:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 03:59:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 03:59:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 03:59:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 03:59:23,168 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 03:59:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:23,169 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 03:59:23,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 03:59:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:59:23,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:23,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:23,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 03:59:23,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:23,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416706511] [2019-12-27 03:59:23,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:23,264 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 03:59:23,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416706511] [2019-12-27 03:59:23,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:23,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:23,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579628977] [2019-12-27 03:59:23,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:23,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:23,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:23,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:23,269 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 03:59:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:23,389 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 03:59:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:23,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:59:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:23,439 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 03:59:23,439 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 03:59:23,440 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 03:59:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 03:59:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 03:59:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 03:59:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 03:59:23,988 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 03:59:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:23,988 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 03:59:23,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 03:59:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:59:23,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:23,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:23,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 03:59:23,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:23,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844078638] [2019-12-27 03:59:23,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:24,108 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 03:59:24,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844078638] [2019-12-27 03:59:24,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:24,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:24,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359551749] [2019-12-27 03:59:24,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:59:24,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:59:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:24,110 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 03:59:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:24,582 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 03:59:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:59:24,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:59:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:24,654 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 03:59:24,654 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 03:59:24,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 03:59:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 03:59:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 03:59:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 03:59:26,312 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 03:59:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:26,313 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 03:59:26,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:59:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 03:59:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:59:26,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:26,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:26,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 03:59:26,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:26,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232102415] [2019-12-27 03:59:26,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:26,458 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 03:59:26,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232102415] [2019-12-27 03:59:26,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:26,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:59:26,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882581587] [2019-12-27 03:59:26,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:59:26,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:59:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:59:26,460 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 03:59:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:27,432 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 03:59:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:27,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:59:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:27,518 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 03:59:27,519 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 03:59:27,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:59:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 03:59:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 03:59:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 03:59:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 03:59:29,035 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 03:59:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 03:59:29,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:59:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 03:59:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:59:29,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:29,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:29,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 03:59:29,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:29,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973168090] [2019-12-27 03:59:29,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:29,120 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 03:59:29,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973168090] [2019-12-27 03:59:29,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:29,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:29,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282124917] [2019-12-27 03:59:29,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:29,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:29,122 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 03:59:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:29,197 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 03:59:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:59:29,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:59:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:29,220 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 03:59:29,221 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 03:59:29,221 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 03:59:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 03:59:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 03:59:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 03:59:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 03:59:29,468 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 03:59:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:29,469 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 03:59:29,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 03:59:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:59:29,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:29,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:29,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 03:59:29,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:29,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880113648] [2019-12-27 03:59:29,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:29,564 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 03:59:29,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880113648] [2019-12-27 03:59:29,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:29,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:59:29,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000468735] [2019-12-27 03:59:29,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:59:29,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:59:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:29,566 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 03:59:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:29,638 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 03:59:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:59:29,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 03:59:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:29,656 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 03:59:29,657 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 03:59:29,657 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 03:59:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 03:59:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 03:59:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 03:59:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 03:59:29,829 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 03:59:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:29,829 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 03:59:29,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:59:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 03:59:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:29,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:29,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:29,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 03:59:29,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:29,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451283916] [2019-12-27 03:59:29,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:29,969 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 03:59:29,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451283916] [2019-12-27 03:59:29,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:29,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:29,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163409334] [2019-12-27 03:59:29,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:29,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:29,972 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-27 03:59:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:30,037 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-27 03:59:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:59:30,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 03:59:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:30,052 INFO L225 Difference]: With dead ends: 20009 [2019-12-27 03:59:30,052 INFO L226 Difference]: Without dead ends: 9365 [2019-12-27 03:59:30,052 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 03:59:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-27 03:59:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-27 03:59:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 03:59:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 03:59:30,193 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 03:59:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:30,194 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 03:59:30,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 03:59:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:30,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:30,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:30,208 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 03:59:30,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:30,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151273163] [2019-12-27 03:59:30,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:30,304 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 03:59:30,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151273163] [2019-12-27 03:59:30,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:30,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:30,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715396072] [2019-12-27 03:59:30,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:30,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:30,307 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-27 03:59:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:30,715 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 03:59:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:30,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:30,742 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 03:59:30,743 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 03:59:30,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 03:59:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 03:59:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 03:59:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 03:59:31,379 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 03:59:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:31,379 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 03:59:31,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 03:59:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:31,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:31,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:31,395 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 03:59:31,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:31,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990210300] [2019-12-27 03:59:31,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:31,490 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 03:59:31,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990210300] [2019-12-27 03:59:31,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:31,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:31,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596081632] [2019-12-27 03:59:31,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:31,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:31,492 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-27 03:59:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:31,923 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-27 03:59:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:31,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:31,963 INFO L225 Difference]: With dead ends: 27840 [2019-12-27 03:59:31,963 INFO L226 Difference]: Without dead ends: 19924 [2019-12-27 03:59:31,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-27 03:59:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-27 03:59:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 03:59:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 03:59:32,223 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 03:59:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:32,223 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 03:59:32,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 03:59:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:32,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:32,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:32,242 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 03:59:32,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:32,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953188074] [2019-12-27 03:59:32,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:32,335 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 03:59:32,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953188074] [2019-12-27 03:59:32,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:32,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:32,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214367635] [2019-12-27 03:59:32,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:32,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:32,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:32,337 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-27 03:59:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:32,740 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-27 03:59:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:59:32,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:32,785 INFO L225 Difference]: With dead ends: 25803 [2019-12-27 03:59:32,786 INFO L226 Difference]: Without dead ends: 23832 [2019-12-27 03:59:32,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-27 03:59:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-27 03:59:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-27 03:59:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-27 03:59:33,080 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-27 03:59:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:33,080 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-27 03:59:33,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-27 03:59:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:33,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:33,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:33,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 03:59:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169596030] [2019-12-27 03:59:33,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:33,155 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 03:59:33,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169596030] [2019-12-27 03:59:33,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:33,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:33,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138961554] [2019-12-27 03:59:33,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:33,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:33,157 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-27 03:59:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:33,263 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-27 03:59:33,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:33,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:59:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:33,293 INFO L225 Difference]: With dead ends: 18737 [2019-12-27 03:59:33,293 INFO L226 Difference]: Without dead ends: 18737 [2019-12-27 03:59:33,293 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 03:59:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-27 03:59:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-27 03:59:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-27 03:59:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-27 03:59:34,064 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-27 03:59:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:34,064 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-27 03:59:34,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-27 03:59:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:34,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:34,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:34,084 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 03:59:34,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:34,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429005752] [2019-12-27 03:59:34,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:34,183 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 03:59:34,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429005752] [2019-12-27 03:59:34,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:34,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:34,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786650508] [2019-12-27 03:59:34,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:59:34,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:59:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:59:34,185 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-27 03:59:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:35,021 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-27 03:59:35,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:59:35,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 03:59:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:35,095 INFO L225 Difference]: With dead ends: 31543 [2019-12-27 03:59:35,096 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 03:59:35,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:59:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 03:59:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-27 03:59:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-27 03:59:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-27 03:59:35,609 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-27 03:59:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:35,609 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-27 03:59:35,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:59:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-27 03:59:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:35,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:35,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:35,642 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 03:59:35,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:35,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583419188] [2019-12-27 03:59:35,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:35,756 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 03:59:35,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583419188] [2019-12-27 03:59:35,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:35,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:59:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007747588] [2019-12-27 03:59:35,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:35,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:35,758 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-27 03:59:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:36,719 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-27 03:59:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:59:36,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:36,766 INFO L225 Difference]: With dead ends: 31464 [2019-12-27 03:59:36,766 INFO L226 Difference]: Without dead ends: 31342 [2019-12-27 03:59:36,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:59:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-27 03:59:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-27 03:59:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-27 03:59:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-27 03:59:37,829 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-27 03:59:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:37,830 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-27 03:59:37,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-27 03:59:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:37,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:37,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:37,870 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 03:59:37,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:37,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259801473] [2019-12-27 03:59:37,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:38,033 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 03:59:38,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259801473] [2019-12-27 03:59:38,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:38,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:59:38,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570017291] [2019-12-27 03:59:38,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:59:38,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:38,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:59:38,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:59:38,035 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-27 03:59:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:39,964 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-27 03:59:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:59:39,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 03:59:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:40,029 INFO L225 Difference]: With dead ends: 41056 [2019-12-27 03:59:40,029 INFO L226 Difference]: Without dead ends: 41056 [2019-12-27 03:59:40,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:59:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-27 03:59:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-27 03:59:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 03:59:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 03:59:40,525 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 03:59:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:40,526 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 03:59:40,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:59:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 03:59:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:40,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:40,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:40,551 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 03:59:40,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:40,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280883216] [2019-12-27 03:59:40,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:40,666 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 03:59:40,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280883216] [2019-12-27 03:59:40,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:40,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:40,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445158105] [2019-12-27 03:59:40,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:40,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:40,668 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 03:59:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:40,783 INFO L93 Difference]: Finished difference Result 23554 states and 73039 transitions. [2019-12-27 03:59:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:40,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:59:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:40,832 INFO L225 Difference]: With dead ends: 23554 [2019-12-27 03:59:40,833 INFO L226 Difference]: Without dead ends: 23554 [2019-12-27 03:59:40,833 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 03:59:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2019-12-27 03:59:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 21366. [2019-12-27 03:59:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21366 states. [2019-12-27 03:59:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21366 states to 21366 states and 67157 transitions. [2019-12-27 03:59:41,233 INFO L78 Accepts]: Start accepts. Automaton has 21366 states and 67157 transitions. Word has length 53 [2019-12-27 03:59:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:41,234 INFO L462 AbstractCegarLoop]: Abstraction has 21366 states and 67157 transitions. [2019-12-27 03:59:41,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21366 states and 67157 transitions. [2019-12-27 03:59:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:59:41,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:41,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:41,258 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1545980158, now seen corresponding path program 1 times [2019-12-27 03:59:41,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:41,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142779924] [2019-12-27 03:59:41,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:41,317 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 03:59:41,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142779924] [2019-12-27 03:59:41,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:41,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:41,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688717698] [2019-12-27 03:59:41,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:41,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:41,319 INFO L87 Difference]: Start difference. First operand 21366 states and 67157 transitions. Second operand 3 states. [2019-12-27 03:59:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:41,815 INFO L93 Difference]: Finished difference Result 15882 states and 48979 transitions. [2019-12-27 03:59:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:41,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:59:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:41,845 INFO L225 Difference]: With dead ends: 15882 [2019-12-27 03:59:41,846 INFO L226 Difference]: Without dead ends: 15882 [2019-12-27 03:59:41,849 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 03:59:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2019-12-27 03:59:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 15239. [2019-12-27 03:59:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15239 states. [2019-12-27 03:59:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15239 states to 15239 states and 46889 transitions. [2019-12-27 03:59:42,247 INFO L78 Accepts]: Start accepts. Automaton has 15239 states and 46889 transitions. Word has length 54 [2019-12-27 03:59:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:42,247 INFO L462 AbstractCegarLoop]: Abstraction has 15239 states and 46889 transitions. [2019-12-27 03:59:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15239 states and 46889 transitions. [2019-12-27 03:59:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:59:42,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:42,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:42,271 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-27 03:59:42,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:42,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642223015] [2019-12-27 03:59:42,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:42,491 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 03:59:42,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642223015] [2019-12-27 03:59:42,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:42,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:59:42,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785880548] [2019-12-27 03:59:42,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:59:42,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:59:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:59:42,495 INFO L87 Difference]: Start difference. First operand 15239 states and 46889 transitions. Second operand 11 states. [2019-12-27 03:59:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:43,604 INFO L93 Difference]: Finished difference Result 31140 states and 95845 transitions. [2019-12-27 03:59:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 03:59:43,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 03:59:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:43,668 INFO L225 Difference]: With dead ends: 31140 [2019-12-27 03:59:43,668 INFO L226 Difference]: Without dead ends: 30574 [2019-12-27 03:59:43,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:59:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30574 states. [2019-12-27 03:59:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30574 to 19726. [2019-12-27 03:59:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19726 states. [2019-12-27 03:59:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19726 states to 19726 states and 60759 transitions. [2019-12-27 03:59:44,091 INFO L78 Accepts]: Start accepts. Automaton has 19726 states and 60759 transitions. Word has length 55 [2019-12-27 03:59:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:44,091 INFO L462 AbstractCegarLoop]: Abstraction has 19726 states and 60759 transitions. [2019-12-27 03:59:44,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:59:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 19726 states and 60759 transitions. [2019-12-27 03:59:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:59:44,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:44,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:44,113 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-27 03:59:44,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:44,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38762571] [2019-12-27 03:59:44,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:44,299 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 03:59:44,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38762571] [2019-12-27 03:59:44,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:44,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:59:44,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638798591] [2019-12-27 03:59:44,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:59:44,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:59:44,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:59:44,303 INFO L87 Difference]: Start difference. First operand 19726 states and 60759 transitions. Second operand 11 states. [2019-12-27 03:59:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:45,320 INFO L93 Difference]: Finished difference Result 31214 states and 95464 transitions. [2019-12-27 03:59:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:59:45,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 03:59:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:45,353 INFO L225 Difference]: With dead ends: 31214 [2019-12-27 03:59:45,353 INFO L226 Difference]: Without dead ends: 23119 [2019-12-27 03:59:45,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:59:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23119 states. [2019-12-27 03:59:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23119 to 15122. [2019-12-27 03:59:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2019-12-27 03:59:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 46004 transitions. [2019-12-27 03:59:46,090 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 46004 transitions. Word has length 55 [2019-12-27 03:59:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:46,091 INFO L462 AbstractCegarLoop]: Abstraction has 15122 states and 46004 transitions. [2019-12-27 03:59:46,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:59:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 46004 transitions. [2019-12-27 03:59:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:59:46,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:46,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:46,107 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-27 03:59:46,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502196355] [2019-12-27 03:59:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:46,300 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 03:59:46,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502196355] [2019-12-27 03:59:46,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:46,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:59:46,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577819341] [2019-12-27 03:59:46,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:59:46,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:59:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:59:46,302 INFO L87 Difference]: Start difference. First operand 15122 states and 46004 transitions. Second operand 12 states. [2019-12-27 03:59:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:47,206 INFO L93 Difference]: Finished difference Result 23598 states and 71304 transitions. [2019-12-27 03:59:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:59:47,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 03:59:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:47,248 INFO L225 Difference]: With dead ends: 23598 [2019-12-27 03:59:47,248 INFO L226 Difference]: Without dead ends: 22929 [2019-12-27 03:59:47,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:59:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22929 states. [2019-12-27 03:59:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22929 to 14804. [2019-12-27 03:59:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-27 03:59:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 45140 transitions. [2019-12-27 03:59:47,752 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 45140 transitions. Word has length 55 [2019-12-27 03:59:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:47,752 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 45140 transitions. [2019-12-27 03:59:47,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:59:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 45140 transitions. [2019-12-27 03:59:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:59:47,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:47,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:47,781 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-27 03:59:47,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:47,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759427633] [2019-12-27 03:59:47,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:59:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:59:47,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:59:47,890 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:59:47,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:59:47,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-27 03:59:47,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-27 03:59:47,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1~0_Out-1894095976 ~x$w_buff0~0_In-1894095976) (= ~x$w_buff0_used~0_In-1894095976 ~x$w_buff1_used~0_Out-1894095976) (= 1 ~x$w_buff0_used~0_Out-1894095976) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1894095976|) (= ~x$w_buff0~0_Out-1894095976 1) (= (mod ~x$w_buff1_used~0_Out-1894095976 256) 0) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1894095976| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1894095976) (= P1Thread1of1ForFork0_~arg.offset_Out-1894095976 |P1Thread1of1ForFork0_#in~arg.offset_In-1894095976|) (= P1Thread1of1ForFork0_~arg.base_Out-1894095976 |P1Thread1of1ForFork0_#in~arg.base_In-1894095976|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1894095976, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1894095976|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1894095976|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1894095976} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1894095976, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1894095976, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1894095976, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1894095976, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1894095976|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1894095976|, ~x$w_buff1~0=~x$w_buff1~0_Out-1894095976, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1894095976|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1894095976, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1894095976} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:59:47,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-2093384592 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2093384592 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-2093384592 |P2Thread1of1ForFork1_#t~ite32_Out-2093384592|) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-2093384592| ~x~0_In-2093384592) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2093384592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2093384592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2093384592, ~x~0=~x~0_In-2093384592} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2093384592|, ~x$w_buff1~0=~x$w_buff1~0_In-2093384592, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2093384592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2093384592, ~x~0=~x~0_In-2093384592} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:59:47,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:59:47,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-499623465 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-499623465 256) 0))) (or (and (= ~x$w_buff0_used~0_In-499623465 |P2Thread1of1ForFork1_#t~ite34_Out-499623465|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-499623465|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-499623465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499623465} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-499623465|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-499623465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-499623465} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:59:47,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-918594145 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-918594145 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-918594145| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-918594145| ~x$w_buff0_used~0_In-918594145) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-918594145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-918594145} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-918594145, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-918594145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-918594145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:59:47,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-350818530 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-350818530 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-350818530 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-350818530 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-350818530| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-350818530| ~x$w_buff1_used~0_In-350818530) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-350818530, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-350818530, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350818530, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350818530} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-350818530, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-350818530, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350818530, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-350818530|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350818530} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:59:47,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-111476354 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-111476354 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-111476354 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-111476354 ~x$r_buff0_thd2~0_Out-111476354) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-111476354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111476354} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-111476354|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-111476354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111476354} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:59:47,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-753921305 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-753921305 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-753921305 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-753921305 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-753921305| ~x$r_buff1_thd2~0_In-753921305)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out-753921305| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-753921305, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-753921305, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-753921305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753921305} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-753921305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753921305, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-753921305, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-753921305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753921305} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:59:47,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:59:47,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1731645678 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In-1731645678| |P0Thread1of1ForFork2_#t~ite11_Out-1731645678|) (= ~x$w_buff1~0_In-1731645678 |P0Thread1of1ForFork2_#t~ite12_Out-1731645678|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1731645678 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1731645678 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1731645678 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1731645678 256)))) (= |P0Thread1of1ForFork2_#t~ite11_Out-1731645678| |P0Thread1of1ForFork2_#t~ite12_Out-1731645678|) (= |P0Thread1of1ForFork2_#t~ite11_Out-1731645678| ~x$w_buff1~0_In-1731645678)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1731645678, ~x$w_buff1~0=~x$w_buff1~0_In-1731645678, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1731645678, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1731645678, ~weak$$choice2~0=~weak$$choice2~0_In-1731645678, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1731645678|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731645678} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1731645678, ~x$w_buff1~0=~x$w_buff1~0_In-1731645678, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1731645678, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1731645678, ~weak$$choice2~0=~weak$$choice2~0_In-1731645678, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1731645678|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1731645678|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1731645678} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:59:47,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1141904851 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1141904851| ~x$w_buff0_used~0_In1141904851) (= |P0Thread1of1ForFork2_#t~ite14_Out1141904851| |P0Thread1of1ForFork2_#t~ite15_Out1141904851|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1141904851 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1141904851 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In1141904851 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1141904851 256))))) (and (= |P0Thread1of1ForFork2_#t~ite15_Out1141904851| ~x$w_buff0_used~0_In1141904851) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1141904851| |P0Thread1of1ForFork2_#t~ite14_Out1141904851|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1141904851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1141904851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1141904851, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1141904851|, ~weak$$choice2~0=~weak$$choice2~0_In1141904851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1141904851} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1141904851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1141904851, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1141904851|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1141904851, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1141904851|, ~weak$$choice2~0=~weak$$choice2~0_In1141904851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1141904851} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:59:47,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1213786458 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1213786458 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1213786458 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In1213786458 256) 0)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1213786458 256))))) (= |P0Thread1of1ForFork2_#t~ite18_Out1213786458| |P0Thread1of1ForFork2_#t~ite17_Out1213786458|) .cse1 (= ~x$w_buff1_used~0_In1213786458 |P0Thread1of1ForFork2_#t~ite17_Out1213786458|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite18_Out1213786458| ~x$w_buff1_used~0_In1213786458) (= |P0Thread1of1ForFork2_#t~ite17_In1213786458| |P0Thread1of1ForFork2_#t~ite17_Out1213786458|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1213786458, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1213786458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1213786458, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1213786458, ~weak$$choice2~0=~weak$$choice2~0_In1213786458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1213786458} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1213786458, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1213786458|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1213786458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1213786458, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1213786458, ~weak$$choice2~0=~weak$$choice2~0_In1213786458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1213786458} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:59:47,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:59:47,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:59:47,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1935803242 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1935803242 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1935803242 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1935803242 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out-1935803242| ~x$w_buff1_used~0_In-1935803242) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1935803242| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1935803242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1935803242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1935803242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935803242} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1935803242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1935803242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1935803242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1935803242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935803242} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:59:47,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1920726891 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1920726891 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1920726891|)) (and (= ~x$r_buff0_thd3~0_In-1920726891 |P2Thread1of1ForFork1_#t~ite36_Out-1920726891|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1920726891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1920726891} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1920726891|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1920726891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1920726891} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:59:47,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1764873950 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1764873950 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1764873950 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1764873950 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1764873950| ~x$r_buff1_thd3~0_In1764873950)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1764873950|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1764873950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1764873950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1764873950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1764873950} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1764873950|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1764873950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1764873950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1764873950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1764873950} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:59:47,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:59:47,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:59:47,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1169774373 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1169774373 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1169774373| ~x~0_In1169774373) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1169774373 |ULTIMATE.start_main_#t~ite41_Out1169774373|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1169774373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1169774373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1169774373, ~x~0=~x~0_In1169774373} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1169774373|, ~x$w_buff1~0=~x$w_buff1~0_In1169774373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1169774373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1169774373, ~x~0=~x~0_In1169774373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:59:47,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:59:47,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In696432436 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In696432436 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out696432436| ~x$w_buff0_used~0_In696432436) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out696432436|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In696432436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In696432436} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In696432436, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out696432436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In696432436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:59:47,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-180757142 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-180757142 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-180757142 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-180757142 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-180757142|)) (and (= ~x$w_buff1_used~0_In-180757142 |ULTIMATE.start_main_#t~ite44_Out-180757142|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-180757142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-180757142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-180757142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-180757142} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-180757142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-180757142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-180757142, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-180757142|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-180757142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:59:47,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1791165242 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1791165242 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1791165242|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1791165242| ~x$r_buff0_thd0~0_In1791165242) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1791165242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791165242} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1791165242, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1791165242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791165242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:59:47,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-605456676 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-605456676 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-605456676 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-605456676 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-605456676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-605456676 |ULTIMATE.start_main_#t~ite46_Out-605456676|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-605456676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-605456676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-605456676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-605456676} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-605456676, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-605456676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-605456676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-605456676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-605456676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:59:47,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:59:47,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:59:47 BasicIcfg [2019-12-27 03:59:47,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:59:47,986 INFO L168 Benchmark]: Toolchain (without parser) took 75026.77 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,987 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.39 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 102.1 MB in the beginning and 159.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 205.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,989 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,990 INFO L168 Benchmark]: RCFGBuilder took 831.25 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 108.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,990 INFO L168 Benchmark]: TraceAbstraction took 73369.41 ms. Allocated memory was 205.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 107.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 03:59:47,994 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 713.39 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 102.1 MB in the beginning and 159.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 205.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.25 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 108.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73369.41 ms. Allocated memory was 205.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 107.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4056 SDtfs, 4999 SDslu, 14064 SDs, 0 SdLazy, 6202 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 31.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 128252 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 172271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...