/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:29:52,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:29:52,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:29:52,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:29:52,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:29:52,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:29:52,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:29:52,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:29:52,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:29:52,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:29:52,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:29:52,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:29:52,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:29:52,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:29:52,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:29:52,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:29:52,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:29:52,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:29:52,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:29:52,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:29:52,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:29:52,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:29:52,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:29:52,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:29:52,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:29:52,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:29:52,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:29:52,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:29:52,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:29:52,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:29:52,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:29:52,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:29:52,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:29:52,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:29:52,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:29:52,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:29:52,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:29:52,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:29:52,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:29:52,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:29:52,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:29:52,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:29:52,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:29:52,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:29:52,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:29:52,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:29:52,717 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:29:52,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:29:52,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:29:52,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:29:52,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:29:52,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:29:52,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:29:52,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:29:52,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:29:52,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:29:52,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:29:52,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:29:52,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:29:52,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:29:52,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:29:52,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:29:52,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:29:52,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:29:52,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:29:52,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:29:52,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:29:52,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:29:52,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:29:52,724 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:29:52,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:29:52,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:29:52,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:29:52,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:29:53,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:29:53,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:29:53,002 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:29:53,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 05:29:53,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987aa3290/38e58fe4d3b54afebc348917d9542c4f/FLAG8c0a28843 [2019-12-27 05:29:53,665 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:29:53,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 05:29:53,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987aa3290/38e58fe4d3b54afebc348917d9542c4f/FLAG8c0a28843 [2019-12-27 05:29:53,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987aa3290/38e58fe4d3b54afebc348917d9542c4f [2019-12-27 05:29:53,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:29:53,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:29:53,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:29:53,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:29:53,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:29:53,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:53" (1/1) ... [2019-12-27 05:29:53,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ede1650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:53, skipping insertion in model container [2019-12-27 05:29:53,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:53" (1/1) ... [2019-12-27 05:29:53,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:29:54,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:29:54,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:29:54,488 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:29:54,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:29:54,709 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:29:54,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54 WrapperNode [2019-12-27 05:29:54,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:29:54,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:29:54,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:29:54,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:29:54,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:29:54,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:29:54,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:29:54,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:29:54,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (1/1) ... [2019-12-27 05:29:54,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:29:54,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:29:54,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:29:54,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:29:54,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (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 05:29:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:29:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:29:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:29:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:29:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:29:54,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:29:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:29:54,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:29:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:29:54,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:29:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:29:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:29:54,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:29:54,922 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 05:29:55,681 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:29:55,681 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:29:55,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:55 BoogieIcfgContainer [2019-12-27 05:29:55,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:29:55,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:29:55,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:29:55,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:29:55,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:29:53" (1/3) ... [2019-12-27 05:29:55,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538881a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:55, skipping insertion in model container [2019-12-27 05:29:55,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:54" (2/3) ... [2019-12-27 05:29:55,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538881a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:55, skipping insertion in model container [2019-12-27 05:29:55,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:55" (3/3) ... [2019-12-27 05:29:55,691 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.oepc.i [2019-12-27 05:29:55,702 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:29:55,703 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:29:55,710 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:29:55,712 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:29:55,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,821 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:29:55,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:29:55,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:29:55,877 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:29:55,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:29:55,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:29:55,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:29:55,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:29:55,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:29:55,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:29:55,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 05:29:55,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:29:56,006 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:29:56,006 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:29:56,029 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:29:56,053 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:29:56,109 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:29:56,110 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:29:56,119 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:29:56,142 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:29:56,143 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:29:58,943 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 05:29:59,641 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:29:59,790 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:29:59,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83227 [2019-12-27 05:29:59,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 05:29:59,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 05:30:18,468 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120962 states. [2019-12-27 05:30:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120962 states. [2019-12-27 05:30:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:30:18,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:18,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:30:18,478 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:18,483 INFO L82 PathProgramCache]: Analyzing trace with hash 919898, now seen corresponding path program 1 times [2019-12-27 05:30:18,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:18,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677529264] [2019-12-27 05:30:18,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:18,716 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 05:30:18,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677529264] [2019-12-27 05:30:18,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:18,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:30:18,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049026995] [2019-12-27 05:30:18,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:18,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:18,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:18,745 INFO L87 Difference]: Start difference. First operand 120962 states. Second operand 3 states. [2019-12-27 05:30:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:22,438 INFO L93 Difference]: Finished difference Result 119798 states and 510282 transitions. [2019-12-27 05:30:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:22,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:30:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:23,098 INFO L225 Difference]: With dead ends: 119798 [2019-12-27 05:30:23,098 INFO L226 Difference]: Without dead ends: 112910 [2019-12-27 05:30:23,100 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 05:30:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112910 states. [2019-12-27 05:30:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112910 to 112910. [2019-12-27 05:30:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112910 states. [2019-12-27 05:30:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112910 states to 112910 states and 480308 transitions. [2019-12-27 05:30:33,017 INFO L78 Accepts]: Start accepts. Automaton has 112910 states and 480308 transitions. Word has length 3 [2019-12-27 05:30:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:33,017 INFO L462 AbstractCegarLoop]: Abstraction has 112910 states and 480308 transitions. [2019-12-27 05:30:33,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 112910 states and 480308 transitions. [2019-12-27 05:30:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:30:33,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:33,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:33,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1163520711, now seen corresponding path program 1 times [2019-12-27 05:30:33,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:33,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380702451] [2019-12-27 05:30:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:33,161 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 05:30:33,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380702451] [2019-12-27 05:30:33,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:33,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:33,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663327504] [2019-12-27 05:30:33,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:33,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:33,168 INFO L87 Difference]: Start difference. First operand 112910 states and 480308 transitions. Second operand 4 states. [2019-12-27 05:30:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:38,914 INFO L93 Difference]: Finished difference Result 175260 states and 715456 transitions. [2019-12-27 05:30:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:38,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:30:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:39,710 INFO L225 Difference]: With dead ends: 175260 [2019-12-27 05:30:39,711 INFO L226 Difference]: Without dead ends: 175211 [2019-12-27 05:30:39,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:30:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175211 states. [2019-12-27 05:30:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175211 to 160651. [2019-12-27 05:30:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160651 states. [2019-12-27 05:30:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160651 states to 160651 states and 663882 transitions. [2019-12-27 05:30:55,670 INFO L78 Accepts]: Start accepts. Automaton has 160651 states and 663882 transitions. Word has length 11 [2019-12-27 05:30:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:55,671 INFO L462 AbstractCegarLoop]: Abstraction has 160651 states and 663882 transitions. [2019-12-27 05:30:55,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 160651 states and 663882 transitions. [2019-12-27 05:30:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:30:55,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:55,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:55,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1406257601, now seen corresponding path program 1 times [2019-12-27 05:30:55,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:55,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905070088] [2019-12-27 05:30:55,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:55,735 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 05:30:55,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905070088] [2019-12-27 05:30:55,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:55,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:55,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104871417] [2019-12-27 05:30:55,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:30:55,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:55,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:30:55,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:30:55,738 INFO L87 Difference]: Start difference. First operand 160651 states and 663882 transitions. Second operand 3 states. [2019-12-27 05:30:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:55,872 INFO L93 Difference]: Finished difference Result 34503 states and 111808 transitions. [2019-12-27 05:30:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:30:55,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:30:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:55,931 INFO L225 Difference]: With dead ends: 34503 [2019-12-27 05:30:55,932 INFO L226 Difference]: Without dead ends: 34503 [2019-12-27 05:30:55,932 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 05:30:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2019-12-27 05:30:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2019-12-27 05:30:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-27 05:30:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 111808 transitions. [2019-12-27 05:30:56,887 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 111808 transitions. Word has length 13 [2019-12-27 05:30:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:56,888 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 111808 transitions. [2019-12-27 05:30:56,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:30:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 111808 transitions. [2019-12-27 05:30:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:30:56,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:56,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:30:56,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1992610691, now seen corresponding path program 1 times [2019-12-27 05:30:56,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:56,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996563569] [2019-12-27 05:30:56,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:57,030 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 05:30:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996563569] [2019-12-27 05:30:57,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:57,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:30:57,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053739326] [2019-12-27 05:30:57,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:30:57,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:30:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:30:57,033 INFO L87 Difference]: Start difference. First operand 34503 states and 111808 transitions. Second operand 4 states. [2019-12-27 05:30:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:30:58,586 INFO L93 Difference]: Finished difference Result 42846 states and 138316 transitions. [2019-12-27 05:30:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:30:58,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:30:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:30:58,658 INFO L225 Difference]: With dead ends: 42846 [2019-12-27 05:30:58,658 INFO L226 Difference]: Without dead ends: 42846 [2019-12-27 05:30:58,658 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 05:30:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-27 05:30:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 38560. [2019-12-27 05:30:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-27 05:30:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 124897 transitions. [2019-12-27 05:30:59,370 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 124897 transitions. Word has length 16 [2019-12-27 05:30:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:30:59,371 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 124897 transitions. [2019-12-27 05:30:59,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:30:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 124897 transitions. [2019-12-27 05:30:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:30:59,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:30:59,381 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 05:30:59,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:30:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:30:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash 352437866, now seen corresponding path program 1 times [2019-12-27 05:30:59,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:30:59,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813771555] [2019-12-27 05:30:59,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:30:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:30:59,477 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 05:30:59,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813771555] [2019-12-27 05:30:59,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:30:59,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:30:59,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243523605] [2019-12-27 05:30:59,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:30:59,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:30:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:30:59,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:30:59,479 INFO L87 Difference]: Start difference. First operand 38560 states and 124897 transitions. Second operand 6 states. [2019-12-27 05:31:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:00,152 INFO L93 Difference]: Finished difference Result 49556 states and 157804 transitions. [2019-12-27 05:31:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:31:00,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:31:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:00,237 INFO L225 Difference]: With dead ends: 49556 [2019-12-27 05:31:00,237 INFO L226 Difference]: Without dead ends: 49549 [2019-12-27 05:31:00,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49549 states. [2019-12-27 05:31:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49549 to 38223. [2019-12-27 05:31:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38223 states. [2019-12-27 05:31:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38223 states to 38223 states and 123617 transitions. [2019-12-27 05:31:01,665 INFO L78 Accepts]: Start accepts. Automaton has 38223 states and 123617 transitions. Word has length 22 [2019-12-27 05:31:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:01,665 INFO L462 AbstractCegarLoop]: Abstraction has 38223 states and 123617 transitions. [2019-12-27 05:31:01,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:31:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 38223 states and 123617 transitions. [2019-12-27 05:31:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:31:01,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:01,678 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 05:31:01,678 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -772014791, now seen corresponding path program 1 times [2019-12-27 05:31:01,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:01,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682428933] [2019-12-27 05:31:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:01,739 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 05:31:01,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682428933] [2019-12-27 05:31:01,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:01,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490679524] [2019-12-27 05:31:01,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:01,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:01,742 INFO L87 Difference]: Start difference. First operand 38223 states and 123617 transitions. Second operand 4 states. [2019-12-27 05:31:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:01,805 INFO L93 Difference]: Finished difference Result 14858 states and 45301 transitions. [2019-12-27 05:31:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:01,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:31:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:01,832 INFO L225 Difference]: With dead ends: 14858 [2019-12-27 05:31:01,832 INFO L226 Difference]: Without dead ends: 14858 [2019-12-27 05:31:01,833 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 05:31:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14858 states. [2019-12-27 05:31:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14858 to 14614. [2019-12-27 05:31:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14614 states. [2019-12-27 05:31:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14614 states to 14614 states and 44605 transitions. [2019-12-27 05:31:02,096 INFO L78 Accepts]: Start accepts. Automaton has 14614 states and 44605 transitions. Word has length 25 [2019-12-27 05:31:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:02,096 INFO L462 AbstractCegarLoop]: Abstraction has 14614 states and 44605 transitions. [2019-12-27 05:31:02,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14614 states and 44605 transitions. [2019-12-27 05:31:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:31:02,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:02,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] [2019-12-27 05:31:02,107 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1959375522, now seen corresponding path program 1 times [2019-12-27 05:31:02,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:02,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051560719] [2019-12-27 05:31:02,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:02,152 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 05:31:02,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051560719] [2019-12-27 05:31:02,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:02,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:02,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831861925] [2019-12-27 05:31:02,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:02,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:02,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:02,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:02,154 INFO L87 Difference]: Start difference. First operand 14614 states and 44605 transitions. Second operand 3 states. [2019-12-27 05:31:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:02,262 INFO L93 Difference]: Finished difference Result 22649 states and 68681 transitions. [2019-12-27 05:31:02,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:02,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:31:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:02,293 INFO L225 Difference]: With dead ends: 22649 [2019-12-27 05:31:02,294 INFO L226 Difference]: Without dead ends: 22649 [2019-12-27 05:31:02,294 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 05:31:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22649 states. [2019-12-27 05:31:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22649 to 17220. [2019-12-27 05:31:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17220 states. [2019-12-27 05:31:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17220 states to 17220 states and 53027 transitions. [2019-12-27 05:31:02,590 INFO L78 Accepts]: Start accepts. Automaton has 17220 states and 53027 transitions. Word has length 27 [2019-12-27 05:31:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:02,590 INFO L462 AbstractCegarLoop]: Abstraction has 17220 states and 53027 transitions. [2019-12-27 05:31:02,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 17220 states and 53027 transitions. [2019-12-27 05:31:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:31:02,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:02,603 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] [2019-12-27 05:31:02,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1187835806, now seen corresponding path program 1 times [2019-12-27 05:31:02,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:02,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213484489] [2019-12-27 05:31:02,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:02,716 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 05:31:02,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213484489] [2019-12-27 05:31:02,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:02,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:31:02,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58341268] [2019-12-27 05:31:02,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:31:02,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:31:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:31:02,718 INFO L87 Difference]: Start difference. First operand 17220 states and 53027 transitions. Second operand 6 states. [2019-12-27 05:31:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:03,536 INFO L93 Difference]: Finished difference Result 35594 states and 106791 transitions. [2019-12-27 05:31:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:31:03,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:31:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:03,585 INFO L225 Difference]: With dead ends: 35594 [2019-12-27 05:31:03,585 INFO L226 Difference]: Without dead ends: 35594 [2019-12-27 05:31:03,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35594 states. [2019-12-27 05:31:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35594 to 20471. [2019-12-27 05:31:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20471 states. [2019-12-27 05:31:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20471 states to 20471 states and 62707 transitions. [2019-12-27 05:31:05,575 INFO L78 Accepts]: Start accepts. Automaton has 20471 states and 62707 transitions. Word has length 27 [2019-12-27 05:31:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:05,576 INFO L462 AbstractCegarLoop]: Abstraction has 20471 states and 62707 transitions. [2019-12-27 05:31:05,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:31:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20471 states and 62707 transitions. [2019-12-27 05:31:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:31:05,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:05,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:05,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 708131532, now seen corresponding path program 1 times [2019-12-27 05:31:05,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:05,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901101095] [2019-12-27 05:31:05,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:05,695 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 05:31:05,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901101095] [2019-12-27 05:31:05,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:05,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:31:05,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014149699] [2019-12-27 05:31:05,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:31:05,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:31:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:31:05,698 INFO L87 Difference]: Start difference. First operand 20471 states and 62707 transitions. Second operand 6 states. [2019-12-27 05:31:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:06,591 INFO L93 Difference]: Finished difference Result 40297 states and 119974 transitions. [2019-12-27 05:31:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:31:06,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 05:31:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:06,650 INFO L225 Difference]: With dead ends: 40297 [2019-12-27 05:31:06,650 INFO L226 Difference]: Without dead ends: 40297 [2019-12-27 05:31:06,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40297 states. [2019-12-27 05:31:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40297 to 21088. [2019-12-27 05:31:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21088 states. [2019-12-27 05:31:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21088 states to 21088 states and 65044 transitions. [2019-12-27 05:31:07,100 INFO L78 Accepts]: Start accepts. Automaton has 21088 states and 65044 transitions. Word has length 28 [2019-12-27 05:31:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:07,101 INFO L462 AbstractCegarLoop]: Abstraction has 21088 states and 65044 transitions. [2019-12-27 05:31:07,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:31:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 21088 states and 65044 transitions. [2019-12-27 05:31:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:31:07,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:07,126 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] [2019-12-27 05:31:07,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2083615183, now seen corresponding path program 1 times [2019-12-27 05:31:07,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:07,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663409584] [2019-12-27 05:31:07,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:07,368 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 05:31:07,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663409584] [2019-12-27 05:31:07,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:07,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:31:07,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134361705] [2019-12-27 05:31:07,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:31:07,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:31:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:31:07,371 INFO L87 Difference]: Start difference. First operand 21088 states and 65044 transitions. Second operand 8 states. [2019-12-27 05:31:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:09,690 INFO L93 Difference]: Finished difference Result 44035 states and 132076 transitions. [2019-12-27 05:31:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:31:09,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:31:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:09,751 INFO L225 Difference]: With dead ends: 44035 [2019-12-27 05:31:09,751 INFO L226 Difference]: Without dead ends: 44035 [2019-12-27 05:31:09,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:31:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44035 states. [2019-12-27 05:31:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44035 to 21997. [2019-12-27 05:31:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21997 states. [2019-12-27 05:31:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21997 states to 21997 states and 67856 transitions. [2019-12-27 05:31:10,190 INFO L78 Accepts]: Start accepts. Automaton has 21997 states and 67856 transitions. Word has length 33 [2019-12-27 05:31:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:10,191 INFO L462 AbstractCegarLoop]: Abstraction has 21997 states and 67856 transitions. [2019-12-27 05:31:10,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:31:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21997 states and 67856 transitions. [2019-12-27 05:31:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:31:10,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:10,214 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] [2019-12-27 05:31:10,214 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2131169195, now seen corresponding path program 2 times [2019-12-27 05:31:10,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:10,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448918390] [2019-12-27 05:31:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:10,367 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 05:31:10,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448918390] [2019-12-27 05:31:10,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:10,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:31:10,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483466737] [2019-12-27 05:31:10,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:31:10,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:31:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:31:10,370 INFO L87 Difference]: Start difference. First operand 21997 states and 67856 transitions. Second operand 8 states. [2019-12-27 05:31:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:12,044 INFO L93 Difference]: Finished difference Result 46984 states and 140763 transitions. [2019-12-27 05:31:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:31:12,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:31:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:12,115 INFO L225 Difference]: With dead ends: 46984 [2019-12-27 05:31:12,116 INFO L226 Difference]: Without dead ends: 46984 [2019-12-27 05:31:12,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:31:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46984 states. [2019-12-27 05:31:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46984 to 23476. [2019-12-27 05:31:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23476 states. [2019-12-27 05:31:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23476 states to 23476 states and 72275 transitions. [2019-12-27 05:31:12,967 INFO L78 Accepts]: Start accepts. Automaton has 23476 states and 72275 transitions. Word has length 33 [2019-12-27 05:31:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:12,967 INFO L462 AbstractCegarLoop]: Abstraction has 23476 states and 72275 transitions. [2019-12-27 05:31:12,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:31:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23476 states and 72275 transitions. [2019-12-27 05:31:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:31:12,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:12,991 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] [2019-12-27 05:31:12,991 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash 572830043, now seen corresponding path program 3 times [2019-12-27 05:31:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:12,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431445957] [2019-12-27 05:31:12,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:13,169 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 05:31:13,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431445957] [2019-12-27 05:31:13,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:13,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:31:13,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155184490] [2019-12-27 05:31:13,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:13,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:13,172 INFO L87 Difference]: Start difference. First operand 23476 states and 72275 transitions. Second operand 9 states. [2019-12-27 05:31:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:15,326 INFO L93 Difference]: Finished difference Result 54165 states and 160908 transitions. [2019-12-27 05:31:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:31:15,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 05:31:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:15,468 INFO L225 Difference]: With dead ends: 54165 [2019-12-27 05:31:15,468 INFO L226 Difference]: Without dead ends: 54165 [2019-12-27 05:31:15,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:31:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54165 states. [2019-12-27 05:31:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54165 to 23350. [2019-12-27 05:31:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23350 states. [2019-12-27 05:31:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23350 states to 23350 states and 71821 transitions. [2019-12-27 05:31:16,166 INFO L78 Accepts]: Start accepts. Automaton has 23350 states and 71821 transitions. Word has length 33 [2019-12-27 05:31:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:16,166 INFO L462 AbstractCegarLoop]: Abstraction has 23350 states and 71821 transitions. [2019-12-27 05:31:16,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23350 states and 71821 transitions. [2019-12-27 05:31:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:16,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:16,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:16,188 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1529567545, now seen corresponding path program 1 times [2019-12-27 05:31:16,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:16,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761521721] [2019-12-27 05:31:16,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:31:16,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761521721] [2019-12-27 05:31:16,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:16,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:31:16,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772419973] [2019-12-27 05:31:16,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:31:16,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:16,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:31:16,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:31:16,339 INFO L87 Difference]: Start difference. First operand 23350 states and 71821 transitions. Second operand 7 states. [2019-12-27 05:31:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:17,915 INFO L93 Difference]: Finished difference Result 46892 states and 139598 transitions. [2019-12-27 05:31:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:31:17,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:31:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:17,977 INFO L225 Difference]: With dead ends: 46892 [2019-12-27 05:31:17,977 INFO L226 Difference]: Without dead ends: 46892 [2019-12-27 05:31:17,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:31:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46892 states. [2019-12-27 05:31:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46892 to 21154. [2019-12-27 05:31:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21154 states. [2019-12-27 05:31:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21154 states to 21154 states and 65338 transitions. [2019-12-27 05:31:18,414 INFO L78 Accepts]: Start accepts. Automaton has 21154 states and 65338 transitions. Word has length 34 [2019-12-27 05:31:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:18,414 INFO L462 AbstractCegarLoop]: Abstraction has 21154 states and 65338 transitions. [2019-12-27 05:31:18,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:31:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21154 states and 65338 transitions. [2019-12-27 05:31:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:31:18,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:18,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:18,435 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 276051641, now seen corresponding path program 2 times [2019-12-27 05:31:18,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:18,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783678643] [2019-12-27 05:31:18,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:18,585 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 05:31:18,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783678643] [2019-12-27 05:31:18,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:18,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:31:18,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046980124] [2019-12-27 05:31:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:31:18,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:18,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:31:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:31:18,589 INFO L87 Difference]: Start difference. First operand 21154 states and 65338 transitions. Second operand 9 states. [2019-12-27 05:31:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:20,471 INFO L93 Difference]: Finished difference Result 55660 states and 164955 transitions. [2019-12-27 05:31:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:31:20,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 05:31:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:20,556 INFO L225 Difference]: With dead ends: 55660 [2019-12-27 05:31:20,556 INFO L226 Difference]: Without dead ends: 55660 [2019-12-27 05:31:20,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:31:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55660 states. [2019-12-27 05:31:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55660 to 20593. [2019-12-27 05:31:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20593 states. [2019-12-27 05:31:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20593 states to 20593 states and 63551 transitions. [2019-12-27 05:31:21,451 INFO L78 Accepts]: Start accepts. Automaton has 20593 states and 63551 transitions. Word has length 34 [2019-12-27 05:31:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:21,451 INFO L462 AbstractCegarLoop]: Abstraction has 20593 states and 63551 transitions. [2019-12-27 05:31:21,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:31:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20593 states and 63551 transitions. [2019-12-27 05:31:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:31:21,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:21,483 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 05:31:21,483 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:21,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash 358675718, now seen corresponding path program 1 times [2019-12-27 05:31:21,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:21,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419234398] [2019-12-27 05:31:21,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:21,543 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 05:31:21,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419234398] [2019-12-27 05:31:21,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:21,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:21,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957725825] [2019-12-27 05:31:21,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:21,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:21,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:21,545 INFO L87 Difference]: Start difference. First operand 20593 states and 63551 transitions. Second operand 4 states. [2019-12-27 05:31:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:21,714 INFO L93 Difference]: Finished difference Result 34666 states and 107392 transitions. [2019-12-27 05:31:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:21,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 05:31:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:21,754 INFO L225 Difference]: With dead ends: 34666 [2019-12-27 05:31:21,754 INFO L226 Difference]: Without dead ends: 17155 [2019-12-27 05:31:21,757 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 05:31:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-12-27 05:31:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 17060. [2019-12-27 05:31:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17060 states. [2019-12-27 05:31:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17060 states to 17060 states and 51753 transitions. [2019-12-27 05:31:22,168 INFO L78 Accepts]: Start accepts. Automaton has 17060 states and 51753 transitions. Word has length 39 [2019-12-27 05:31:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:22,168 INFO L462 AbstractCegarLoop]: Abstraction has 17060 states and 51753 transitions. [2019-12-27 05:31:22,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17060 states and 51753 transitions. [2019-12-27 05:31:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:31:22,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:22,196 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 05:31:22,196 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1572679302, now seen corresponding path program 2 times [2019-12-27 05:31:22,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:22,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942967560] [2019-12-27 05:31:22,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:22,247 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 05:31:22,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942967560] [2019-12-27 05:31:22,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:22,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:31:22,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700164085] [2019-12-27 05:31:22,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:22,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:22,252 INFO L87 Difference]: Start difference. First operand 17060 states and 51753 transitions. Second operand 3 states. [2019-12-27 05:31:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:22,321 INFO L93 Difference]: Finished difference Result 17059 states and 51751 transitions. [2019-12-27 05:31:22,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:22,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:31:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:22,348 INFO L225 Difference]: With dead ends: 17059 [2019-12-27 05:31:22,348 INFO L226 Difference]: Without dead ends: 17059 [2019-12-27 05:31:22,348 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 05:31:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17059 states. [2019-12-27 05:31:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17059 to 17059. [2019-12-27 05:31:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17059 states. [2019-12-27 05:31:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 51751 transitions. [2019-12-27 05:31:22,612 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 51751 transitions. Word has length 39 [2019-12-27 05:31:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:22,612 INFO L462 AbstractCegarLoop]: Abstraction has 17059 states and 51751 transitions. [2019-12-27 05:31:22,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 51751 transitions. [2019-12-27 05:31:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:31:22,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:22,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:22,632 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1861174117, now seen corresponding path program 1 times [2019-12-27 05:31:22,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:22,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747001115] [2019-12-27 05:31:22,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:31:22,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747001115] [2019-12-27 05:31:22,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:22,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:22,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355616517] [2019-12-27 05:31:22,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:22,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:22,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:22,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:22,681 INFO L87 Difference]: Start difference. First operand 17059 states and 51751 transitions. Second operand 4 states. [2019-12-27 05:31:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:22,816 INFO L93 Difference]: Finished difference Result 29717 states and 89747 transitions. [2019-12-27 05:31:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:22,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 05:31:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:22,847 INFO L225 Difference]: With dead ends: 29717 [2019-12-27 05:31:22,847 INFO L226 Difference]: Without dead ends: 14733 [2019-12-27 05:31:22,848 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 05:31:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14733 states. [2019-12-27 05:31:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14733 to 14675. [2019-12-27 05:31:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14675 states. [2019-12-27 05:31:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14675 states to 14675 states and 42815 transitions. [2019-12-27 05:31:23,079 INFO L78 Accepts]: Start accepts. Automaton has 14675 states and 42815 transitions. Word has length 40 [2019-12-27 05:31:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:23,079 INFO L462 AbstractCegarLoop]: Abstraction has 14675 states and 42815 transitions. [2019-12-27 05:31:23,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 14675 states and 42815 transitions. [2019-12-27 05:31:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:31:23,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:23,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:23,094 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 437381093, now seen corresponding path program 2 times [2019-12-27 05:31:23,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:23,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781125352] [2019-12-27 05:31:23,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:23,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 05:31:23,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781125352] [2019-12-27 05:31:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:31:23,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732941072] [2019-12-27 05:31:23,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:23,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:23,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:23,162 INFO L87 Difference]: Start difference. First operand 14675 states and 42815 transitions. Second operand 3 states. [2019-12-27 05:31:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:23,223 INFO L93 Difference]: Finished difference Result 13809 states and 39477 transitions. [2019-12-27 05:31:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:23,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:31:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:23,246 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 05:31:23,246 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 05:31:23,247 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 05:31:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 05:31:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13805. [2019-12-27 05:31:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13805 states. [2019-12-27 05:31:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13805 states to 13805 states and 39469 transitions. [2019-12-27 05:31:23,450 INFO L78 Accepts]: Start accepts. Automaton has 13805 states and 39469 transitions. Word has length 40 [2019-12-27 05:31:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:23,451 INFO L462 AbstractCegarLoop]: Abstraction has 13805 states and 39469 transitions. [2019-12-27 05:31:23,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13805 states and 39469 transitions. [2019-12-27 05:31:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:31:23,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:23,462 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] [2019-12-27 05:31:23,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:23,463 INFO L82 PathProgramCache]: Analyzing trace with hash 989699623, now seen corresponding path program 1 times [2019-12-27 05:31:23,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:23,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595962730] [2019-12-27 05:31:23,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:31:23,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595962730] [2019-12-27 05:31:23,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:23,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:31:23,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454917105] [2019-12-27 05:31:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:23,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:23,529 INFO L87 Difference]: Start difference. First operand 13805 states and 39469 transitions. Second operand 3 states. [2019-12-27 05:31:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:23,584 INFO L93 Difference]: Finished difference Result 13724 states and 39212 transitions. [2019-12-27 05:31:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:23,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 05:31:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:23,602 INFO L225 Difference]: With dead ends: 13724 [2019-12-27 05:31:23,602 INFO L226 Difference]: Without dead ends: 13724 [2019-12-27 05:31:23,603 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 05:31:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13724 states. [2019-12-27 05:31:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13724 to 11729. [2019-12-27 05:31:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2019-12-27 05:31:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 34053 transitions. [2019-12-27 05:31:23,930 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 34053 transitions. Word has length 41 [2019-12-27 05:31:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:23,930 INFO L462 AbstractCegarLoop]: Abstraction has 11729 states and 34053 transitions. [2019-12-27 05:31:23,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 34053 transitions. [2019-12-27 05:31:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:31:23,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:23,942 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] [2019-12-27 05:31:23,944 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1295739171, now seen corresponding path program 1 times [2019-12-27 05:31:23,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:23,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262555773] [2019-12-27 05:31:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:24,003 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 05:31:24,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262555773] [2019-12-27 05:31:24,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:24,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:31:24,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142952655] [2019-12-27 05:31:24,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:31:24,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:31:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:31:24,005 INFO L87 Difference]: Start difference. First operand 11729 states and 34053 transitions. Second operand 5 states. [2019-12-27 05:31:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:24,068 INFO L93 Difference]: Finished difference Result 10722 states and 31819 transitions. [2019-12-27 05:31:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:31:24,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 05:31:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:24,083 INFO L225 Difference]: With dead ends: 10722 [2019-12-27 05:31:24,083 INFO L226 Difference]: Without dead ends: 8035 [2019-12-27 05:31:24,084 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 05:31:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8035 states. [2019-12-27 05:31:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8035 to 8035. [2019-12-27 05:31:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8035 states. [2019-12-27 05:31:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 25522 transitions. [2019-12-27 05:31:24,321 INFO L78 Accepts]: Start accepts. Automaton has 8035 states and 25522 transitions. Word has length 42 [2019-12-27 05:31:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:24,321 INFO L462 AbstractCegarLoop]: Abstraction has 8035 states and 25522 transitions. [2019-12-27 05:31:24,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:31:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 8035 states and 25522 transitions. [2019-12-27 05:31:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:24,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:24,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:24,340 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1765746588, now seen corresponding path program 1 times [2019-12-27 05:31:24,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090593440] [2019-12-27 05:31:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:24,463 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 05:31:24,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090593440] [2019-12-27 05:31:24,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:24,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:31:24,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385685274] [2019-12-27 05:31:24,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:31:24,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:31:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:31:24,467 INFO L87 Difference]: Start difference. First operand 8035 states and 25522 transitions. Second operand 7 states. [2019-12-27 05:31:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:24,847 INFO L93 Difference]: Finished difference Result 16674 states and 51904 transitions. [2019-12-27 05:31:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:31:24,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 05:31:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:24,877 INFO L225 Difference]: With dead ends: 16674 [2019-12-27 05:31:24,878 INFO L226 Difference]: Without dead ends: 11941 [2019-12-27 05:31:24,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:31:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2019-12-27 05:31:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 9778. [2019-12-27 05:31:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9778 states. [2019-12-27 05:31:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9778 states to 9778 states and 30664 transitions. [2019-12-27 05:31:25,194 INFO L78 Accepts]: Start accepts. Automaton has 9778 states and 30664 transitions. Word has length 66 [2019-12-27 05:31:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:25,194 INFO L462 AbstractCegarLoop]: Abstraction has 9778 states and 30664 transitions. [2019-12-27 05:31:25,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:31:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 9778 states and 30664 transitions. [2019-12-27 05:31:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:25,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:25,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:25,210 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -309400938, now seen corresponding path program 2 times [2019-12-27 05:31:25,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:25,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642750235] [2019-12-27 05:31:25,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:25,561 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 05:31:25,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642750235] [2019-12-27 05:31:25,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:25,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:25,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132598702] [2019-12-27 05:31:25,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:25,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:25,563 INFO L87 Difference]: Start difference. First operand 9778 states and 30664 transitions. Second operand 10 states. [2019-12-27 05:31:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:26,269 INFO L93 Difference]: Finished difference Result 17599 states and 55002 transitions. [2019-12-27 05:31:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:31:26,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:31:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:26,293 INFO L225 Difference]: With dead ends: 17599 [2019-12-27 05:31:26,293 INFO L226 Difference]: Without dead ends: 16274 [2019-12-27 05:31:26,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:31:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16274 states. [2019-12-27 05:31:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16274 to 13232. [2019-12-27 05:31:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13232 states. [2019-12-27 05:31:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13232 states to 13232 states and 41765 transitions. [2019-12-27 05:31:26,528 INFO L78 Accepts]: Start accepts. Automaton has 13232 states and 41765 transitions. Word has length 66 [2019-12-27 05:31:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:26,528 INFO L462 AbstractCegarLoop]: Abstraction has 13232 states and 41765 transitions. [2019-12-27 05:31:26,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 13232 states and 41765 transitions. [2019-12-27 05:31:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:26,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:26,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:26,545 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1328086916, now seen corresponding path program 3 times [2019-12-27 05:31:26,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:26,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092399633] [2019-12-27 05:31:26,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:26,759 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 05:31:26,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092399633] [2019-12-27 05:31:26,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:26,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:26,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606129868] [2019-12-27 05:31:26,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:26,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:26,765 INFO L87 Difference]: Start difference. First operand 13232 states and 41765 transitions. Second operand 10 states. [2019-12-27 05:31:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:27,494 INFO L93 Difference]: Finished difference Result 20062 states and 62209 transitions. [2019-12-27 05:31:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:31:27,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:31:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:27,518 INFO L225 Difference]: With dead ends: 20062 [2019-12-27 05:31:27,518 INFO L226 Difference]: Without dead ends: 14287 [2019-12-27 05:31:27,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:31:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2019-12-27 05:31:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 10156. [2019-12-27 05:31:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10156 states. [2019-12-27 05:31:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 31524 transitions. [2019-12-27 05:31:27,700 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 31524 transitions. Word has length 66 [2019-12-27 05:31:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:27,700 INFO L462 AbstractCegarLoop]: Abstraction has 10156 states and 31524 transitions. [2019-12-27 05:31:27,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 31524 transitions. [2019-12-27 05:31:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:27,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:27,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:27,711 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 216475928, now seen corresponding path program 4 times [2019-12-27 05:31:27,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:27,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642454918] [2019-12-27 05:31:27,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:31:28,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642454918] [2019-12-27 05:31:28,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:28,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:31:28,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705380282] [2019-12-27 05:31:28,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:31:28,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:31:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:31:28,238 INFO L87 Difference]: Start difference. First operand 10156 states and 31524 transitions. Second operand 14 states. [2019-12-27 05:31:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:30,310 INFO L93 Difference]: Finished difference Result 18648 states and 57112 transitions. [2019-12-27 05:31:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:31:30,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 05:31:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:30,333 INFO L225 Difference]: With dead ends: 18648 [2019-12-27 05:31:30,334 INFO L226 Difference]: Without dead ends: 13033 [2019-12-27 05:31:30,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2019-12-27 05:31:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13033 states. [2019-12-27 05:31:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13033 to 10342. [2019-12-27 05:31:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2019-12-27 05:31:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 31875 transitions. [2019-12-27 05:31:30,527 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 31875 transitions. Word has length 66 [2019-12-27 05:31:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:30,527 INFO L462 AbstractCegarLoop]: Abstraction has 10342 states and 31875 transitions. [2019-12-27 05:31:30,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:31:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 31875 transitions. [2019-12-27 05:31:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:30,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:30,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:30,541 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1892110130, now seen corresponding path program 5 times [2019-12-27 05:31:30,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:30,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340947538] [2019-12-27 05:31:30,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:30,953 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 05:31:30,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340947538] [2019-12-27 05:31:30,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:30,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:31:30,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631837394] [2019-12-27 05:31:30,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:31:30,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:30,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:31:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:31:30,955 INFO L87 Difference]: Start difference. First operand 10342 states and 31875 transitions. Second operand 15 states. [2019-12-27 05:31:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:32,848 INFO L93 Difference]: Finished difference Result 12875 states and 39317 transitions. [2019-12-27 05:31:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:31:32,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 05:31:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:32,867 INFO L225 Difference]: With dead ends: 12875 [2019-12-27 05:31:32,867 INFO L226 Difference]: Without dead ends: 11402 [2019-12-27 05:31:32,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:31:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2019-12-27 05:31:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 10892. [2019-12-27 05:31:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10892 states. [2019-12-27 05:31:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10892 states to 10892 states and 33561 transitions. [2019-12-27 05:31:33,047 INFO L78 Accepts]: Start accepts. Automaton has 10892 states and 33561 transitions. Word has length 66 [2019-12-27 05:31:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 10892 states and 33561 transitions. [2019-12-27 05:31:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:31:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 10892 states and 33561 transitions. [2019-12-27 05:31:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:33,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:33,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:33,059 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash -546923214, now seen corresponding path program 6 times [2019-12-27 05:31:33,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:33,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628285244] [2019-12-27 05:31:33,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:33,385 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 05:31:33,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628285244] [2019-12-27 05:31:33,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:33,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:31:33,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480086545] [2019-12-27 05:31:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:31:33,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:31:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:33,387 INFO L87 Difference]: Start difference. First operand 10892 states and 33561 transitions. Second operand 11 states. [2019-12-27 05:31:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:34,259 INFO L93 Difference]: Finished difference Result 15855 states and 48602 transitions. [2019-12-27 05:31:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:31:34,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:31:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:34,281 INFO L225 Difference]: With dead ends: 15855 [2019-12-27 05:31:34,281 INFO L226 Difference]: Without dead ends: 14644 [2019-12-27 05:31:34,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:31:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14644 states. [2019-12-27 05:31:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14644 to 12192. [2019-12-27 05:31:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12192 states. [2019-12-27 05:31:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12192 states to 12192 states and 37768 transitions. [2019-12-27 05:31:34,635 INFO L78 Accepts]: Start accepts. Automaton has 12192 states and 37768 transitions. Word has length 66 [2019-12-27 05:31:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:34,635 INFO L462 AbstractCegarLoop]: Abstraction has 12192 states and 37768 transitions. [2019-12-27 05:31:34,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:31:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12192 states and 37768 transitions. [2019-12-27 05:31:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:34,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:34,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:34,649 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1521262930, now seen corresponding path program 7 times [2019-12-27 05:31:34,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:34,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712413656] [2019-12-27 05:31:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:34,909 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 05:31:34,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712413656] [2019-12-27 05:31:34,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:34,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:31:34,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843832863] [2019-12-27 05:31:34,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:31:34,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:31:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:31:34,910 INFO L87 Difference]: Start difference. First operand 12192 states and 37768 transitions. Second operand 11 states. [2019-12-27 05:31:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:35,667 INFO L93 Difference]: Finished difference Result 15094 states and 45834 transitions. [2019-12-27 05:31:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:31:35,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:31:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:35,685 INFO L225 Difference]: With dead ends: 15094 [2019-12-27 05:31:35,685 INFO L226 Difference]: Without dead ends: 12379 [2019-12-27 05:31:35,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:31:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12379 states. [2019-12-27 05:31:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12379 to 9912. [2019-12-27 05:31:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9912 states. [2019-12-27 05:31:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9912 states to 9912 states and 30623 transitions. [2019-12-27 05:31:35,858 INFO L78 Accepts]: Start accepts. Automaton has 9912 states and 30623 transitions. Word has length 66 [2019-12-27 05:31:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:35,859 INFO L462 AbstractCegarLoop]: Abstraction has 9912 states and 30623 transitions. [2019-12-27 05:31:35,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:31:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9912 states and 30623 transitions. [2019-12-27 05:31:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:35,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:35,870 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1535370206, now seen corresponding path program 8 times [2019-12-27 05:31:35,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:35,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218942059] [2019-12-27 05:31:35,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:36,112 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 05:31:36,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218942059] [2019-12-27 05:31:36,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:36,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:36,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105736621] [2019-12-27 05:31:36,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:36,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:36,114 INFO L87 Difference]: Start difference. First operand 9912 states and 30623 transitions. Second operand 10 states. [2019-12-27 05:31:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:37,083 INFO L93 Difference]: Finished difference Result 11031 states and 33455 transitions. [2019-12-27 05:31:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 05:31:37,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:31:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:37,101 INFO L225 Difference]: With dead ends: 11031 [2019-12-27 05:31:37,101 INFO L226 Difference]: Without dead ends: 10530 [2019-12-27 05:31:37,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:31:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10530 states. [2019-12-27 05:31:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10530 to 9752. [2019-12-27 05:31:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9752 states. [2019-12-27 05:31:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9752 states to 9752 states and 30144 transitions. [2019-12-27 05:31:37,270 INFO L78 Accepts]: Start accepts. Automaton has 9752 states and 30144 transitions. Word has length 66 [2019-12-27 05:31:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:37,270 INFO L462 AbstractCegarLoop]: Abstraction has 9752 states and 30144 transitions. [2019-12-27 05:31:37,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9752 states and 30144 transitions. [2019-12-27 05:31:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:37,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:37,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:37,283 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash 381314950, now seen corresponding path program 9 times [2019-12-27 05:31:37,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:37,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333862758] [2019-12-27 05:31:37,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:37,506 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 05:31:37,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333862758] [2019-12-27 05:31:37,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:37,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:31:37,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6528516] [2019-12-27 05:31:37,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:31:37,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:37,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:31:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:31:37,508 INFO L87 Difference]: Start difference. First operand 9752 states and 30144 transitions. Second operand 10 states. [2019-12-27 05:31:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:38,611 INFO L93 Difference]: Finished difference Result 12250 states and 36991 transitions. [2019-12-27 05:31:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 05:31:38,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:31:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:38,629 INFO L225 Difference]: With dead ends: 12250 [2019-12-27 05:31:38,629 INFO L226 Difference]: Without dead ends: 12003 [2019-12-27 05:31:38,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:31:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12003 states. [2019-12-27 05:31:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12003 to 9768. [2019-12-27 05:31:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9768 states. [2019-12-27 05:31:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9768 states to 9768 states and 30188 transitions. [2019-12-27 05:31:38,800 INFO L78 Accepts]: Start accepts. Automaton has 9768 states and 30188 transitions. Word has length 66 [2019-12-27 05:31:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:38,800 INFO L462 AbstractCegarLoop]: Abstraction has 9768 states and 30188 transitions. [2019-12-27 05:31:38,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:31:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 9768 states and 30188 transitions. [2019-12-27 05:31:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:38,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:38,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:38,812 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 676120254, now seen corresponding path program 10 times [2019-12-27 05:31:38,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:38,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18615623] [2019-12-27 05:31:38,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:39,093 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 05:31:39,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18615623] [2019-12-27 05:31:39,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:39,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:31:39,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367572881] [2019-12-27 05:31:39,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:31:39,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:31:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:31:39,095 INFO L87 Difference]: Start difference. First operand 9768 states and 30188 transitions. Second operand 12 states. [2019-12-27 05:31:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:40,560 INFO L93 Difference]: Finished difference Result 11033 states and 33507 transitions. [2019-12-27 05:31:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:31:40,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 05:31:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:40,576 INFO L225 Difference]: With dead ends: 11033 [2019-12-27 05:31:40,576 INFO L226 Difference]: Without dead ends: 10786 [2019-12-27 05:31:40,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:31:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10786 states. [2019-12-27 05:31:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10786 to 9592. [2019-12-27 05:31:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9592 states. [2019-12-27 05:31:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9592 states to 9592 states and 29704 transitions. [2019-12-27 05:31:40,727 INFO L78 Accepts]: Start accepts. Automaton has 9592 states and 29704 transitions. Word has length 66 [2019-12-27 05:31:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:40,727 INFO L462 AbstractCegarLoop]: Abstraction has 9592 states and 29704 transitions. [2019-12-27 05:31:40,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:31:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9592 states and 29704 transitions. [2019-12-27 05:31:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:31:40,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:40,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:40,738 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1166423712, now seen corresponding path program 11 times [2019-12-27 05:31:40,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:40,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179244870] [2019-12-27 05:31:40,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:40,820 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 05:31:40,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179244870] [2019-12-27 05:31:40,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:40,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:40,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814030645] [2019-12-27 05:31:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:31:40,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:31:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:31:40,822 INFO L87 Difference]: Start difference. First operand 9592 states and 29704 transitions. Second operand 4 states. [2019-12-27 05:31:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:40,932 INFO L93 Difference]: Finished difference Result 11888 states and 36549 transitions. [2019-12-27 05:31:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:40,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:31:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:40,953 INFO L225 Difference]: With dead ends: 11888 [2019-12-27 05:31:40,954 INFO L226 Difference]: Without dead ends: 11888 [2019-12-27 05:31:40,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 05:31:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2019-12-27 05:31:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 9926. [2019-12-27 05:31:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9926 states. [2019-12-27 05:31:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9926 states to 9926 states and 30762 transitions. [2019-12-27 05:31:41,127 INFO L78 Accepts]: Start accepts. Automaton has 9926 states and 30762 transitions. Word has length 66 [2019-12-27 05:31:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:41,127 INFO L462 AbstractCegarLoop]: Abstraction has 9926 states and 30762 transitions. [2019-12-27 05:31:41,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:31:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9926 states and 30762 transitions. [2019-12-27 05:31:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:41,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:41,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:41,138 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash 415961500, now seen corresponding path program 1 times [2019-12-27 05:31:41,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:41,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274372297] [2019-12-27 05:31:41,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:41,190 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 05:31:41,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274372297] [2019-12-27 05:31:41,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:41,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:31:41,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424088550] [2019-12-27 05:31:41,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:31:41,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:31:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:31:41,192 INFO L87 Difference]: Start difference. First operand 9926 states and 30762 transitions. Second operand 3 states. [2019-12-27 05:31:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:41,357 INFO L93 Difference]: Finished difference Result 14820 states and 45824 transitions. [2019-12-27 05:31:41,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:31:41,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 05:31:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:41,378 INFO L225 Difference]: With dead ends: 14820 [2019-12-27 05:31:41,378 INFO L226 Difference]: Without dead ends: 14820 [2019-12-27 05:31:41,379 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 05:31:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14820 states. [2019-12-27 05:31:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14820 to 10195. [2019-12-27 05:31:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10195 states. [2019-12-27 05:31:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10195 states to 10195 states and 31633 transitions. [2019-12-27 05:31:41,562 INFO L78 Accepts]: Start accepts. Automaton has 10195 states and 31633 transitions. Word has length 67 [2019-12-27 05:31:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:41,563 INFO L462 AbstractCegarLoop]: Abstraction has 10195 states and 31633 transitions. [2019-12-27 05:31:41,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:31:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10195 states and 31633 transitions. [2019-12-27 05:31:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:41,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:41,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:41,574 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash -375139298, now seen corresponding path program 2 times [2019-12-27 05:31:41,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:41,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920400392] [2019-12-27 05:31:41,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:31:41,694 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 05:31:41,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920400392] [2019-12-27 05:31:41,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:31:41,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:31:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912205921] [2019-12-27 05:31:41,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:31:41,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:31:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:31:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:31:41,696 INFO L87 Difference]: Start difference. First operand 10195 states and 31633 transitions. Second operand 6 states. [2019-12-27 05:31:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:31:41,811 INFO L93 Difference]: Finished difference Result 10063 states and 31110 transitions. [2019-12-27 05:31:41,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:31:41,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 05:31:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:31:41,829 INFO L225 Difference]: With dead ends: 10063 [2019-12-27 05:31:41,829 INFO L226 Difference]: Without dead ends: 10063 [2019-12-27 05:31:41,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:31:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10063 states. [2019-12-27 05:31:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10063 to 8880. [2019-12-27 05:31:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8880 states. [2019-12-27 05:31:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8880 states to 8880 states and 27451 transitions. [2019-12-27 05:31:41,986 INFO L78 Accepts]: Start accepts. Automaton has 8880 states and 27451 transitions. Word has length 67 [2019-12-27 05:31:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:31:41,986 INFO L462 AbstractCegarLoop]: Abstraction has 8880 states and 27451 transitions. [2019-12-27 05:31:41,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:31:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8880 states and 27451 transitions. [2019-12-27 05:31:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:31:41,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:31:41,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:31:41,997 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:31:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:31:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 139331638, now seen corresponding path program 1 times [2019-12-27 05:31:41,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:31:41,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126079859] [2019-12-27 05:31:41,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:31:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:31:42,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:31:42,168 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:31:42,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_20) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t397~0.base_25|) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t397~0.base_25| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t397~0.base_25|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_25|) |v_ULTIMATE.start_main_~#t397~0.offset_20| 0))) (= 0 v_~a$w_buff1~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd3~0_77 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~a$w_buff0~0_23) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~a$r_buff1_thd1~0_21) (= v_~a$r_buff0_thd1~0_29 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~a$r_buff0_thd2~0_21 0) (= 0 v_~a$r_buff1_thd0~0_22) (= |v_ULTIMATE.start_main_~#t397~0.offset_20| 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~z~0_8) (= v_~y~0_11 0) (= 0 v_~a$read_delayed~0_6) (= 0 v_~a$r_buff1_thd3~0_50) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= 0 v_~a$w_buff0_used~0_108) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t397~0.base_25| 4) |v_#length_23|) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t397~0.offset=|v_ULTIMATE.start_main_~#t397~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t397~0.base=|v_ULTIMATE.start_main_~#t397~0.base_25|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~y~0=v_~y~0_11, ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_15|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_21, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t398~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t397~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t397~0.base, ULTIMATE.start_main_~#t398~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t399~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:31:42,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L837-1-->L839: Formula: (and (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12| 1) |v_#valid_34|) (not (= |v_ULTIMATE.start_main_~#t398~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t398~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t398~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t398~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12|) |v_ULTIMATE.start_main_~#t398~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t398~0.offset, #length] because there is no mapped edge [2019-12-27 05:31:42,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L839-1-->L841: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t399~0.base_13|)) (= |v_ULTIMATE.start_main_~#t399~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t399~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13|) |v_ULTIMATE.start_main_~#t399~0.offset_11| 2))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t399~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_~#t399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 05:31:42,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L4-->L758: Formula: (and (= ~x~0_Out-449441455 ~__unbuffered_p0_EAX~0_Out-449441455) (= ~a$r_buff1_thd2~0_Out-449441455 ~a$r_buff0_thd2~0_In-449441455) (= ~a$r_buff1_thd3~0_Out-449441455 ~a$r_buff0_thd3~0_In-449441455) (= 1 ~x~0_Out-449441455) (= ~a$r_buff0_thd1~0_In-449441455 ~a$r_buff1_thd1~0_Out-449441455) (= ~y~0_In-449441455 ~__unbuffered_p0_EBX~0_Out-449441455) (= ~a$r_buff0_thd0~0_In-449441455 ~a$r_buff1_thd0~0_Out-449441455) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-449441455 0)) (= 1 ~a$r_buff0_thd1~0_Out-449441455)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-449441455, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-449441455, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-449441455, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-449441455, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-449441455, ~y~0=~y~0_In-449441455} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-449441455, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-449441455, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-449441455, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-449441455, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-449441455, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-449441455, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-449441455, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-449441455, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-449441455, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-449441455, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-449441455, ~y~0=~y~0_In-449441455, ~x~0=~x~0_Out-449441455} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:31:42,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In55458481 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In55458481 256)))) (or (and (= ~a$w_buff0_used~0_In55458481 |P0Thread1of1ForFork1_#t~ite5_Out55458481|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out55458481|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In55458481, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In55458481} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out55458481|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In55458481, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In55458481} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:31:42,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In73141477 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In73141477 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In73141477 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In73141477 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out73141477| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In73141477 |P0Thread1of1ForFork1_#t~ite6_Out73141477|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In73141477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In73141477, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In73141477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In73141477} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out73141477|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In73141477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In73141477, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In73141477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In73141477} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:31:42,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-397175968 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-397175968 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-397175968| ~a$w_buff1~0_In-397175968)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-397175968| ~a~0_In-397175968) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-397175968, ~a$w_buff1~0=~a$w_buff1~0_In-397175968, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-397175968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-397175968} OutVars{~a~0=~a~0_In-397175968, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-397175968|, ~a$w_buff1~0=~a$w_buff1~0_In-397175968, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-397175968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-397175968} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:31:42,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In319038911 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In319038911 256)))) (or (and (= ~a$r_buff0_thd1~0_Out319038911 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out319038911 ~a$r_buff0_thd1~0_In319038911)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In319038911, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In319038911} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out319038911|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In319038911, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out319038911} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In872033522 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In872033522 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In872033522 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In872033522 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out872033522|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In872033522 |P0Thread1of1ForFork1_#t~ite8_Out872033522|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In872033522, ~a$w_buff0_used~0=~a$w_buff0_used~0_In872033522, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In872033522, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872033522} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out872033522|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In872033522, ~a$w_buff0_used~0=~a$w_buff0_used~0_In872033522, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In872033522, ~a$w_buff1_used~0=~a$w_buff1_used~0_In872033522} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:31:42,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1453452322 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1453452322 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1453452322| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1453452322| ~a$w_buff0_used~0_In-1453452322)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1453452322, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1453452322} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1453452322, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1453452322, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1453452322|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:31:42,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1818428114 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1818428114 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-1818428114 256) 0) .cse0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In-1818428114 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1818428114 256)))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1818428114| |P2Thread1of1ForFork0_#t~ite20_Out-1818428114|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1818428114| ~a$w_buff0~0_In-1818428114) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In-1818428114| |P2Thread1of1ForFork0_#t~ite20_Out-1818428114|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1818428114| ~a$w_buff0~0_In-1818428114)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1818428114, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1818428114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1818428114, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1818428114, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1818428114, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1818428114|, ~weak$$choice2~0=~weak$$choice2~0_In-1818428114} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1818428114|, ~a$w_buff0~0=~a$w_buff0~0_In-1818428114, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1818428114, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1818428114, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1818428114, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1818428114|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1818428114, ~weak$$choice2~0=~weak$$choice2~0_In-1818428114} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:31:42,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2017112183 256) 0))) (or (and (= ~a$w_buff1~0_In-2017112183 |P2Thread1of1ForFork0_#t~ite24_Out-2017112183|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-2017112183| |P2Thread1of1ForFork0_#t~ite23_Out-2017112183|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-2017112183| |P2Thread1of1ForFork0_#t~ite23_Out-2017112183|) (= ~a$w_buff1~0_In-2017112183 |P2Thread1of1ForFork0_#t~ite23_Out-2017112183|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2017112183 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-2017112183 256))) (= 0 (mod ~a$w_buff0_used~0_In-2017112183 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-2017112183 256) 0))))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-2017112183, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-2017112183|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2017112183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2017112183, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2017112183, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2017112183, ~weak$$choice2~0=~weak$$choice2~0_In-2017112183} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-2017112183, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-2017112183|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-2017112183|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2017112183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2017112183, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2017112183, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2017112183, ~weak$$choice2~0=~weak$$choice2~0_In-2017112183} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:31:42,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1262601395 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1262601395| |P2Thread1of1ForFork0_#t~ite26_Out-1262601395|) (= ~a$w_buff0_used~0_In-1262601395 |P2Thread1of1ForFork0_#t~ite27_Out-1262601395|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-1262601395| ~a$w_buff0_used~0_In-1262601395) (= |P2Thread1of1ForFork0_#t~ite26_Out-1262601395| |P2Thread1of1ForFork0_#t~ite27_Out-1262601395|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1262601395 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1262601395 256))) (= (mod ~a$w_buff0_used~0_In-1262601395 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1262601395 256) 0))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1262601395|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262601395, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262601395, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262601395, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262601395, ~weak$$choice2~0=~weak$$choice2~0_In-1262601395} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1262601395|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1262601395|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262601395, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262601395, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262601395, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262601395, ~weak$$choice2~0=~weak$$choice2~0_In-1262601395} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:31:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_49 v_~a$r_buff0_thd3~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:31:42,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:31:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1064998912 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1064998912 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1064998912| ~a~0_In1064998912)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1064998912| ~a$w_buff1~0_In1064998912) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In1064998912, ~a$w_buff1~0=~a$w_buff1~0_In1064998912, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1064998912, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1064998912} OutVars{~a~0=~a~0_In1064998912, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1064998912|, ~a$w_buff1~0=~a$w_buff1~0_In1064998912, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1064998912, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1064998912} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:31:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:31:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2030511499 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2030511499 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out2030511499| ~a$w_buff0_used~0_In2030511499) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2030511499| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2030511499, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2030511499} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2030511499|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2030511499, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2030511499} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:31:42,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1678065001 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1678065001 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1678065001 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1678065001 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1678065001| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out1678065001| ~a$w_buff1_used~0_In1678065001)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1678065001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1678065001, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1678065001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1678065001} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1678065001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1678065001, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1678065001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1678065001, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1678065001|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:31:42,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1032094316 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1032094316 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1032094316| ~a$r_buff0_thd3~0_In-1032094316)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1032094316|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1032094316, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1032094316} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1032094316, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1032094316, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1032094316|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:31:42,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-725163360 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-725163360 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-725163360 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-725163360 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-725163360| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-725163360| ~a$r_buff1_thd3~0_In-725163360)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-725163360, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-725163360, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-725163360, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-725163360} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-725163360|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-725163360, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-725163360, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-725163360, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-725163360} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:31:42,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:31:42,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1346436645 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In1346436645 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1346436645 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1346436645 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1346436645|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1346436645 |P1Thread1of1ForFork2_#t~ite12_Out1346436645|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1346436645, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1346436645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1346436645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1346436645} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1346436645, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1346436645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1346436645, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1346436645|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1346436645} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:31:42,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1867879563 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1867879563 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1867879563|) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1867879563 |P1Thread1of1ForFork2_#t~ite13_Out1867879563|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1867879563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1867879563} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1867879563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1867879563, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1867879563|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:31:42,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1149405393 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1149405393 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1149405393 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1149405393 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1149405393|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In1149405393 |P1Thread1of1ForFork2_#t~ite14_Out1149405393|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1149405393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1149405393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1149405393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1149405393} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1149405393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1149405393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1149405393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1149405393, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1149405393|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:31:42,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:31:42,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:31:42,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In461462491 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In461462491 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out461462491| ~a$w_buff1~0_In461462491) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In461462491 |ULTIMATE.start_main_#t~ite47_Out461462491|)))) InVars {~a~0=~a~0_In461462491, ~a$w_buff1~0=~a$w_buff1~0_In461462491, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In461462491, ~a$w_buff1_used~0=~a$w_buff1_used~0_In461462491} OutVars{~a~0=~a~0_In461462491, ~a$w_buff1~0=~a$w_buff1~0_In461462491, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out461462491|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In461462491, ~a$w_buff1_used~0=~a$w_buff1_used~0_In461462491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:31:42,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:31:42,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1034112489 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1034112489 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1034112489| ~a$w_buff0_used~0_In-1034112489)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1034112489| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1034112489, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1034112489} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1034112489, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1034112489|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1034112489} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:31:42,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1947390120 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-1947390120 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1947390120 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1947390120 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1947390120|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-1947390120 |ULTIMATE.start_main_#t~ite50_Out-1947390120|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1947390120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1947390120, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1947390120, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1947390120} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1947390120|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1947390120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1947390120, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1947390120, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1947390120} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:31:42,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1488449443 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1488449443 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1488449443|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-1488449443 |ULTIMATE.start_main_#t~ite51_Out-1488449443|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488449443, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1488449443} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1488449443|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488449443, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1488449443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:31:42,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In728872103 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In728872103 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In728872103 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In728872103 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out728872103| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out728872103| ~a$r_buff1_thd0~0_In728872103)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In728872103, ~a$w_buff0_used~0=~a$w_buff0_used~0_In728872103, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In728872103, ~a$w_buff1_used~0=~a$w_buff1_used~0_In728872103} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out728872103|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In728872103, ~a$w_buff0_used~0=~a$w_buff0_used~0_In728872103, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In728872103, ~a$w_buff1_used~0=~a$w_buff1_used~0_In728872103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:31:42,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p0_EAX~0_12) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~a$r_buff1_thd0~0_19)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:31:42,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:31:42 BasicIcfg [2019-12-27 05:31:42,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:31:42,330 INFO L168 Benchmark]: Toolchain (without parser) took 108393.52 ms. Allocated memory was 146.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,330 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.32 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,331 INFO L168 Benchmark]: Boogie Preprocessor took 75.06 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,331 INFO L168 Benchmark]: RCFGBuilder took 832.48 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 101.1 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,333 INFO L168 Benchmark]: TraceAbstraction took 106641.74 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 05:31:42,335 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.32 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.06 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.48 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 101.1 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106641.74 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7008 VarBasedMoverChecksPositive, 202 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 83227 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=7, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=7, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=7, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=7, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=7, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=7, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7322 SDtfs, 10520 SDslu, 25463 SDs, 0 SdLazy, 15708 SolverSat, 558 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 32 SyntacticMatches, 26 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160651occurred 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: 39.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 238928 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1507 NumberOfCodeBlocks, 1507 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1407 ConstructedInterpolants, 0 QuantifiedInterpolants, 408397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...