/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:19:31,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:19:31,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:19:31,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:19:31,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:19:31,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:19:31,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:19:31,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:19:31,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:19:31,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:19:31,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:19:31,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:19:31,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:19:31,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:19:31,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:19:31,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:19:31,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:19:31,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:19:31,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:19:31,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:19:31,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:19:31,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:19:31,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:19:31,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:19:31,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:19:31,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:19:31,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:19:31,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:19:31,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:19:31,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:19:31,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:19:31,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:19:31,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:19:31,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:19:31,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:19:31,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:19:31,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:19:31,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:19:31,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:19:31,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:19:31,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:19:31,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:19:31,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:19:31,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:19:31,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:19:31,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:19:31,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:19:31,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:19:31,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:19:31,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:19:31,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:19:31,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:19:31,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:19:31,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:19:31,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:19:31,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:19:31,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:19:31,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:19:31,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:31,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:19:31,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:19:31,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:19:31,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:19:31,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:19:31,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:19:31,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:19:31,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:19:31,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-26 22:19:31,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f4fd8e6/ca359c084a114f8e8f0069f9123c6ebf/FLAGf3619c825 [2019-12-26 22:19:32,472 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:19:32,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-26 22:19:32,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f4fd8e6/ca359c084a114f8e8f0069f9123c6ebf/FLAGf3619c825 [2019-12-26 22:19:32,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f4fd8e6/ca359c084a114f8e8f0069f9123c6ebf [2019-12-26 22:19:32,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:19:32,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:19:32,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:32,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:19:32,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:19:32,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:32" (1/1) ... [2019-12-26 22:19:32,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:32, skipping insertion in model container [2019-12-26 22:19:32,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:19:32" (1/1) ... [2019-12-26 22:19:32,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:19:32,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:19:33,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:33,415 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:19:33,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:19:33,618 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:19:33,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33 WrapperNode [2019-12-26 22:19:33,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:19:33,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:33,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:19:33,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:19:33,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:19:33,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:19:33,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:19:33,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:19:33,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... [2019-12-26 22:19:33,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:19:33,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:19:33,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:19:33,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:19:33,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:19:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:19:33,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:19:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:19:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:19:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:19:33,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:19:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:19:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:19:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:19:33,806 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:19:34,566 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:19:34,566 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:19:34,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:34 BoogieIcfgContainer [2019-12-26 22:19:34,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:19:34,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:19:34,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:19:34,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:19:34,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:19:32" (1/3) ... [2019-12-26 22:19:34,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7a6cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:34, skipping insertion in model container [2019-12-26 22:19:34,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:19:33" (2/3) ... [2019-12-26 22:19:34,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7a6cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:19:34, skipping insertion in model container [2019-12-26 22:19:34,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:19:34" (3/3) ... [2019-12-26 22:19:34,577 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-26 22:19:34,587 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:19:34,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:19:34,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:19:34,595 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:19:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,670 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:19:34,727 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:19:34,747 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:19:34,747 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:19:34,748 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:19:34,748 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:19:34,748 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:19:34,748 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:19:34,748 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:19:34,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:19:34,766 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-26 22:19:34,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 22:19:34,871 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 22:19:34,872 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:34,888 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:19:34,912 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 22:19:34,966 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 22:19:34,966 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:19:34,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:19:34,996 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:19:34,997 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:19:39,759 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-26 22:19:40,604 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:19:40,748 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:19:40,787 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-26 22:19:40,787 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 22:19:40,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-26 22:20:03,509 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-26 22:20:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-26 22:20:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:20:03,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:03,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:20:03,518 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-26 22:20:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-26 22:20:03,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:03,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187203767] [2019-12-26 22:20:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:20:03,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187203767] [2019-12-26 22:20:03,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:03,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:20:03,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006815606] [2019-12-26 22:20:03,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:03,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:03,811 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-26 22:20:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:07,980 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-26 22:20:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:07,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:20:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:08,717 INFO L225 Difference]: With dead ends: 128376 [2019-12-26 22:20:08,718 INFO L226 Difference]: Without dead ends: 120914 [2019-12-26 22:20:08,719 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-26 22:20:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-26 22:20:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-26 22:20:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-26 22:20:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-26 22:20:20,004 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-26 22:20:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:20,005 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-26 22:20:20,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-26 22:20:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:20:20,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:20,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:20:20,011 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-26 22:20:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-26 22:20:20,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:20,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922528393] [2019-12-26 22:20:20,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:20,131 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-26 22:20:20,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922528393] [2019-12-26 22:20:20,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:20,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:20:20,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962486446] [2019-12-26 22:20:20,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:20:20,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:20:20,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:20:20,135 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-26 22:20:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:27,021 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-26 22:20:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:20:27,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:20:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:27,809 INFO L225 Difference]: With dead ends: 187704 [2019-12-26 22:20:27,809 INFO L226 Difference]: Without dead ends: 187655 [2019-12-26 22:20:27,810 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-26 22:20:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-26 22:20:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-26 22:20:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-26 22:20:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-26 22:20:38,989 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-26 22:20:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:38,990 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-26 22:20:38,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:20:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-26 22:20:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:20:38,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:38,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:20:38,997 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-26 22:20:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-26 22:20:38,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:38,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920422802] [2019-12-26 22:20:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:39,052 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-26 22:20:39,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920422802] [2019-12-26 22:20:39,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:39,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:20:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920257328] [2019-12-26 22:20:39,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:39,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:39,055 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-26 22:20:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:44,146 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-26 22:20:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:44,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:20:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:44,210 INFO L225 Difference]: With dead ends: 36261 [2019-12-26 22:20:44,210 INFO L226 Difference]: Without dead ends: 36261 [2019-12-26 22:20:44,210 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-26 22:20:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-26 22:20:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-26 22:20:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-26 22:20:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-26 22:20:44,938 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-26 22:20:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:44,939 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-26 22:20:44,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-26 22:20:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:20:44,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:44,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:20:44,942 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-26 22:20:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-26 22:20:44,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:44,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177999317] [2019-12-26 22:20:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:45,035 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-26 22:20:45,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177999317] [2019-12-26 22:20:45,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:45,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:45,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366158500] [2019-12-26 22:20:45,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:20:45,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:20:45,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:20:45,037 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-26 22:20:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:45,620 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-26 22:20:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:20:45,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:20:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:45,707 INFO L225 Difference]: With dead ends: 50300 [2019-12-26 22:20:45,707 INFO L226 Difference]: Without dead ends: 50300 [2019-12-26 22:20:45,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:20:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-26 22:20:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-26 22:20:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-26 22:20:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-26 22:20:46,922 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-26 22:20:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:46,924 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-26 22:20:46,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:20:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-26 22:20:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:20:46,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:46,934 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-26 22:20:46,934 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-26 22:20:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-26 22:20:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:46,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185348801] [2019-12-26 22:20:46,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:47,047 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-26 22:20:47,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185348801] [2019-12-26 22:20:47,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:47,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:20:47,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105768938] [2019-12-26 22:20:47,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:20:47,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:20:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:20:47,052 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-26 22:20:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:47,984 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-26 22:20:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:20:47,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:20:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:48,094 INFO L225 Difference]: With dead ends: 64122 [2019-12-26 22:20:48,094 INFO L226 Difference]: Without dead ends: 64115 [2019-12-26 22:20:48,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:20:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-26 22:20:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-26 22:20:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 22:20:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-26 22:20:48,999 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-26 22:20:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:49,000 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-26 22:20:49,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:20:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-26 22:20:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:20:49,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:49,014 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-26 22:20:49,015 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-26 22:20:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-26 22:20:49,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:49,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680970533] [2019-12-26 22:20:49,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:49,076 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-26 22:20:49,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680970533] [2019-12-26 22:20:49,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:49,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:49,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358483907] [2019-12-26 22:20:49,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:20:49,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:20:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:20:49,079 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-26 22:20:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:49,146 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-26 22:20:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:20:49,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:20:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:49,171 INFO L225 Difference]: With dead ends: 17024 [2019-12-26 22:20:49,171 INFO L226 Difference]: Without dead ends: 17024 [2019-12-26 22:20:49,171 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-26 22:20:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-26 22:20:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-26 22:20:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-26 22:20:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-26 22:20:49,711 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-26 22:20:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:49,711 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-26 22:20:49,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:20:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-26 22:20:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:20:49,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:49,726 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-26 22:20:49,726 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-26 22:20:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-26 22:20:49,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:49,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870973872] [2019-12-26 22:20:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:49,795 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-26 22:20:49,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870973872] [2019-12-26 22:20:49,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:49,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:49,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988534340] [2019-12-26 22:20:49,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:49,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:49,797 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-26 22:20:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:49,911 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-26 22:20:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:49,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:20:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:49,959 INFO L225 Difference]: With dead ends: 24375 [2019-12-26 22:20:49,959 INFO L226 Difference]: Without dead ends: 24375 [2019-12-26 22:20:49,960 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-26 22:20:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-26 22:20:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-26 22:20:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-26 22:20:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-26 22:20:50,299 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-26 22:20:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:50,300 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-26 22:20:50,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-26 22:20:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:20:50,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:50,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:20:50,313 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-26 22:20:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-26 22:20:50,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:50,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425776955] [2019-12-26 22:20:50,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:50,402 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-26 22:20:50,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425776955] [2019-12-26 22:20:50,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:50,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:20:50,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696361682] [2019-12-26 22:20:50,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:20:50,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:50,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:20:50,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:20:50,405 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-26 22:20:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:51,011 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-26 22:20:51,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:20:51,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:20:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:51,060 INFO L225 Difference]: With dead ends: 26038 [2019-12-26 22:20:51,061 INFO L226 Difference]: Without dead ends: 26038 [2019-12-26 22:20:51,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:20:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-26 22:20:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-26 22:20:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-26 22:20:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-26 22:20:51,434 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-26 22:20:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:51,434 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-26 22:20:51,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:20:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-26 22:20:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:20:51,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:51,456 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-26 22:20:51,456 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-26 22:20:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-26 22:20:51,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:51,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477240722] [2019-12-26 22:20:51,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:51,546 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-26 22:20:51,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477240722] [2019-12-26 22:20:51,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:51,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:20:51,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690351993] [2019-12-26 22:20:51,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:20:51,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:20:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:20:51,549 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-26 22:20:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:52,901 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-26 22:20:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:20:52,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:20:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:52,944 INFO L225 Difference]: With dead ends: 28794 [2019-12-26 22:20:52,944 INFO L226 Difference]: Without dead ends: 28794 [2019-12-26 22:20:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:20:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-26 22:20:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-26 22:20:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-26 22:20:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-26 22:20:53,492 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-26 22:20:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:53,493 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-26 22:20:53,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:20:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-26 22:20:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:20:53,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:53,517 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-26 22:20:53,518 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-26 22:20:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-26 22:20:53,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:53,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793789011] [2019-12-26 22:20:53,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:53,579 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-26 22:20:53,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793789011] [2019-12-26 22:20:53,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:53,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:53,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799064604] [2019-12-26 22:20:53,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:20:53,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:20:53,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:20:53,582 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-26 22:20:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:53,736 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-26 22:20:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:20:53,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-26 22:20:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:53,773 INFO L225 Difference]: With dead ends: 33180 [2019-12-26 22:20:53,774 INFO L226 Difference]: Without dead ends: 16657 [2019-12-26 22:20:53,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:20:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-26 22:20:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-26 22:20:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-26 22:20:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-26 22:20:54,136 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-26 22:20:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:54,136 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-26 22:20:54,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:20:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-26 22:20:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:20:54,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:54,156 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-26 22:20:54,156 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-26 22:20:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-26 22:20:54,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:54,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676766120] [2019-12-26 22:20:54,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:54,215 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-26 22:20:54,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676766120] [2019-12-26 22:20:54,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:54,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:20:54,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48940293] [2019-12-26 22:20:54,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:54,217 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-26 22:20:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:54,286 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-26 22:20:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:54,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:20:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:54,318 INFO L225 Difference]: With dead ends: 16582 [2019-12-26 22:20:54,319 INFO L226 Difference]: Without dead ends: 16582 [2019-12-26 22:20:54,319 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-26 22:20:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-26 22:20:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-26 22:20:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-26 22:20:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-26 22:20:54,578 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-26 22:20:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:54,578 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-26 22:20:54,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-26 22:20:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:20:54,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:54,594 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-26 22:20:54,594 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-26 22:20:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-26 22:20:54,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:54,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233651080] [2019-12-26 22:20:54,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:54,655 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-26 22:20:54,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233651080] [2019-12-26 22:20:54,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:54,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:54,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586170472] [2019-12-26 22:20:54,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:20:54,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:20:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:20:54,657 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-26 22:20:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:54,774 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-26 22:20:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:20:54,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 22:20:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:54,799 INFO L225 Difference]: With dead ends: 26060 [2019-12-26 22:20:54,799 INFO L226 Difference]: Without dead ends: 11670 [2019-12-26 22:20:54,800 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-26 22:20:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-26 22:20:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-26 22:20:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-26 22:20:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-26 22:20:55,137 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-26 22:20:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:55,137 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-26 22:20:55,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:20:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-26 22:20:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:20:55,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:55,156 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-26 22:20:55,156 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-26 22:20:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-26 22:20:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:55,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643473642] [2019-12-26 22:20:55,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:20:55,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643473642] [2019-12-26 22:20:55,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:55,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:20:55,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103297937] [2019-12-26 22:20:55,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:20:55,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:20:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:20:55,215 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-26 22:20:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:55,277 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-26 22:20:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:20:55,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:20:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:55,293 INFO L225 Difference]: With dead ends: 10656 [2019-12-26 22:20:55,293 INFO L226 Difference]: Without dead ends: 7573 [2019-12-26 22:20:55,294 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-26 22:20:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-26 22:20:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-26 22:20:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-26 22:20:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-26 22:20:55,485 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-26 22:20:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:55,485 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-26 22:20:55,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:20:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-26 22:20:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:20:55,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:55,496 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] [2019-12-26 22:20:55,496 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-26 22:20:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-26 22:20:55,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:55,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320464784] [2019-12-26 22:20:55,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:55,546 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-26 22:20:55,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320464784] [2019-12-26 22:20:55,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:55,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:20:55,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118091468] [2019-12-26 22:20:55,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:20:55,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:20:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:20:55,548 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-26 22:20:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:55,624 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-26 22:20:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:20:55,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:20:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:55,648 INFO L225 Difference]: With dead ends: 10082 [2019-12-26 22:20:55,649 INFO L226 Difference]: Without dead ends: 10082 [2019-12-26 22:20:55,649 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-26 22:20:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-26 22:20:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-26 22:20:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-26 22:20:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-26 22:20:55,951 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-26 22:20:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:55,952 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-26 22:20:55,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:20:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-26 22:20:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:20:55,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:55,967 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] [2019-12-26 22:20:55,968 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-26 22:20:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-26 22:20:55,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080678952] [2019-12-26 22:20:55,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:56,060 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-26 22:20:56,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080678952] [2019-12-26 22:20:56,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:56,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:20:56,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254390562] [2019-12-26 22:20:56,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:20:56,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:20:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:20:56,062 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-26 22:20:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:56,380 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-26 22:20:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:20:56,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:20:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:56,402 INFO L225 Difference]: With dead ends: 15437 [2019-12-26 22:20:56,402 INFO L226 Difference]: Without dead ends: 11573 [2019-12-26 22:20:56,402 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-26 22:20:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-26 22:20:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-26 22:20:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-26 22:20:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-26 22:20:56,728 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-26 22:20:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:56,728 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-26 22:20:56,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:20:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-26 22:20:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:20:56,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:56,741 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] [2019-12-26 22:20:56,742 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-26 22:20:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-26 22:20:56,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:56,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70531072] [2019-12-26 22:20:56,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:56,859 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-26 22:20:56,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70531072] [2019-12-26 22:20:56,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:56,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:20:56,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059649574] [2019-12-26 22:20:56,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:20:56,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:20:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:20:56,863 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-26 22:20:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:57,194 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-26 22:20:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:20:57,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:20:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:57,221 INFO L225 Difference]: With dead ends: 17385 [2019-12-26 22:20:57,221 INFO L226 Difference]: Without dead ends: 13105 [2019-12-26 22:20:57,222 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-26 22:20:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-26 22:20:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-26 22:20:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-26 22:20:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-26 22:20:57,539 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-26 22:20:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:57,539 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-26 22:20:57,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:20:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-26 22:20:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:20:57,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:57,555 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] [2019-12-26 22:20:57,555 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-26 22:20:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-26 22:20:57,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:57,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454010763] [2019-12-26 22:20:57,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:57,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-26 22:20:57,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454010763] [2019-12-26 22:20:57,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:57,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:20:57,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357450413] [2019-12-26 22:20:57,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:20:57,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:20:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:20:57,681 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-26 22:20:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:20:58,770 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-26 22:20:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:20:58,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:20:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:20:58,801 INFO L225 Difference]: With dead ends: 24832 [2019-12-26 22:20:58,801 INFO L226 Difference]: Without dead ends: 22344 [2019-12-26 22:20:58,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:20:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-26 22:20:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-26 22:20:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-26 22:20:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-26 22:20:59,063 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-26 22:20:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:20:59,063 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-26 22:20:59,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:20:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-26 22:20:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:20:59,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:20:59,076 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] [2019-12-26 22:20:59,077 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-26 22:20:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:20:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-26 22:20:59,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:20:59,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554475371] [2019-12-26 22:20:59,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:20:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:20:59,203 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-26 22:20:59,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554475371] [2019-12-26 22:20:59,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:20:59,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:20:59,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278875671] [2019-12-26 22:20:59,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:20:59,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:20:59,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:20:59,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:20:59,205 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-26 22:21:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:00,402 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-26 22:21:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:21:00,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:21:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:00,454 INFO L225 Difference]: With dead ends: 28772 [2019-12-26 22:21:00,454 INFO L226 Difference]: Without dead ends: 26348 [2019-12-26 22:21:00,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:21:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-26 22:21:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-26 22:21:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-26 22:21:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-26 22:21:00,796 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-26 22:21:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:00,796 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-26 22:21:00,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-26 22:21:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:21:00,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:00,808 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] [2019-12-26 22:21:00,808 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-26 22:21:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-26 22:21:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:00,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914170252] [2019-12-26 22:21:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914170252] [2019-12-26 22:21:00,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:00,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:00,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564823132] [2019-12-26 22:21:00,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:00,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:00,866 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-26 22:21:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:00,964 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-26 22:21:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:00,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:21:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:00,987 INFO L225 Difference]: With dead ends: 12322 [2019-12-26 22:21:00,987 INFO L226 Difference]: Without dead ends: 12322 [2019-12-26 22:21:00,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 22:21:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-26 22:21:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-26 22:21:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-26 22:21:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-26 22:21:01,370 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-26 22:21:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:01,370 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-26 22:21:01,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-26 22:21:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:01,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:01,382 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] [2019-12-26 22:21:01,382 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-26 22:21:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-26 22:21:01,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:01,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752906261] [2019-12-26 22:21:01,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:01,489 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-26 22:21:01,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752906261] [2019-12-26 22:21:01,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:21:01,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094765073] [2019-12-26 22:21:01,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:21:01,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:21:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:21:01,491 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-26 22:21:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:02,318 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-26 22:21:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:02,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:21:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:02,370 INFO L225 Difference]: With dead ends: 29477 [2019-12-26 22:21:02,370 INFO L226 Difference]: Without dead ends: 26544 [2019-12-26 22:21:02,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:21:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-26 22:21:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-26 22:21:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-26 22:21:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-26 22:21:02,798 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-26 22:21:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:02,799 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-26 22:21:02,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:21:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-26 22:21:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:02,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:02,811 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] [2019-12-26 22:21:02,812 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-26 22:21:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-26 22:21:02,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:02,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835243890] [2019-12-26 22:21:02,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:02,922 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-26 22:21:02,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835243890] [2019-12-26 22:21:02,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:02,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:02,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542592371] [2019-12-26 22:21:02,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:02,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:02,924 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-26 22:21:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:03,882 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-26 22:21:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:21:03,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:21:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:03,922 INFO L225 Difference]: With dead ends: 32061 [2019-12-26 22:21:03,922 INFO L226 Difference]: Without dead ends: 29128 [2019-12-26 22:21:03,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:21:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-26 22:21:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-26 22:21:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-26 22:21:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-26 22:21:04,247 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-26 22:21:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:04,247 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-26 22:21:04,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-26 22:21:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:04,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:04,265 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] [2019-12-26 22:21:04,266 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-26 22:21:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-26 22:21:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097641669] [2019-12-26 22:21:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:21:04,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097641669] [2019-12-26 22:21:04,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:04,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293381281] [2019-12-26 22:21:04,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:21:04,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:21:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:21:04,386 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-26 22:21:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:05,683 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-26 22:21:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:21:05,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:21:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:05,728 INFO L225 Difference]: With dead ends: 33909 [2019-12-26 22:21:05,728 INFO L226 Difference]: Without dead ends: 30991 [2019-12-26 22:21:05,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:21:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-26 22:21:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-26 22:21:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-26 22:21:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-26 22:21:06,052 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-26 22:21:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:06,052 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-26 22:21:06,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:21:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-26 22:21:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:06,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:06,066 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] [2019-12-26 22:21:06,066 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-26 22:21:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-26 22:21:06,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:06,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982009319] [2019-12-26 22:21:06,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:06,177 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-26 22:21:06,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982009319] [2019-12-26 22:21:06,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:06,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:21:06,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283766825] [2019-12-26 22:21:06,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:21:06,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:21:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:21:06,187 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-26 22:21:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:06,335 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-26 22:21:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:21:06,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:21:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:06,362 INFO L225 Difference]: With dead ends: 11142 [2019-12-26 22:21:06,363 INFO L226 Difference]: Without dead ends: 11142 [2019-12-26 22:21:06,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:21:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-26 22:21:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-26 22:21:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-26 22:21:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-26 22:21:06,897 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-26 22:21:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:06,897 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-26 22:21:06,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:21:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-26 22:21:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:06,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:06,914 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] [2019-12-26 22:21:06,914 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-26 22:21:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-26 22:21:06,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:06,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724343655] [2019-12-26 22:21:06,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:07,174 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-26 22:21:07,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724343655] [2019-12-26 22:21:07,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:07,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:21:07,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804251907] [2019-12-26 22:21:07,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:21:07,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:21:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:21:07,176 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 12 states. [2019-12-26 22:21:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:09,658 INFO L93 Difference]: Finished difference Result 21945 states and 65666 transitions. [2019-12-26 22:21:09,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 22:21:09,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-26 22:21:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:09,689 INFO L225 Difference]: With dead ends: 21945 [2019-12-26 22:21:09,689 INFO L226 Difference]: Without dead ends: 21693 [2019-12-26 22:21:09,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-26 22:21:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21693 states. [2019-12-26 22:21:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21693 to 16899. [2019-12-26 22:21:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16899 states. [2019-12-26 22:21:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16899 states to 16899 states and 50854 transitions. [2019-12-26 22:21:09,993 INFO L78 Accepts]: Start accepts. Automaton has 16899 states and 50854 transitions. Word has length 65 [2019-12-26 22:21:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:09,993 INFO L462 AbstractCegarLoop]: Abstraction has 16899 states and 50854 transitions. [2019-12-26 22:21:09,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:21:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16899 states and 50854 transitions. [2019-12-26 22:21:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:21:10,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:10,012 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] [2019-12-26 22:21:10,012 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-26 22:21:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-26 22:21:10,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:10,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775104765] [2019-12-26 22:21:10,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:10,085 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-26 22:21:10,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775104765] [2019-12-26 22:21:10,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:10,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:10,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843155084] [2019-12-26 22:21:10,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:10,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:10,087 INFO L87 Difference]: Start difference. First operand 16899 states and 50854 transitions. Second operand 3 states. [2019-12-26 22:21:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:10,171 INFO L93 Difference]: Finished difference Result 16898 states and 50852 transitions. [2019-12-26 22:21:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:10,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:21:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:10,204 INFO L225 Difference]: With dead ends: 16898 [2019-12-26 22:21:10,205 INFO L226 Difference]: Without dead ends: 16898 [2019-12-26 22:21:10,205 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-26 22:21:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16898 states. [2019-12-26 22:21:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16898 to 13629. [2019-12-26 22:21:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13629 states. [2019-12-26 22:21:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13629 states to 13629 states and 41865 transitions. [2019-12-26 22:21:10,568 INFO L78 Accepts]: Start accepts. Automaton has 13629 states and 41865 transitions. Word has length 65 [2019-12-26 22:21:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:10,569 INFO L462 AbstractCegarLoop]: Abstraction has 13629 states and 41865 transitions. [2019-12-26 22:21:10,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13629 states and 41865 transitions. [2019-12-26 22:21:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:21:10,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:10,583 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-26 22:21:10,583 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-26 22:21:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-26 22:21:10,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:10,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984034021] [2019-12-26 22:21:10,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:10,646 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-26 22:21:10,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984034021] [2019-12-26 22:21:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:10,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:21:10,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406602112] [2019-12-26 22:21:10,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:21:10,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:21:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:21:10,648 INFO L87 Difference]: Start difference. First operand 13629 states and 41865 transitions. Second operand 3 states. [2019-12-26 22:21:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:10,692 INFO L93 Difference]: Finished difference Result 8641 states and 26214 transitions. [2019-12-26 22:21:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:21:10,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:21:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:10,707 INFO L225 Difference]: With dead ends: 8641 [2019-12-26 22:21:10,708 INFO L226 Difference]: Without dead ends: 8641 [2019-12-26 22:21:10,708 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-26 22:21:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2019-12-26 22:21:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8368. [2019-12-26 22:21:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8368 states. [2019-12-26 22:21:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8368 states to 8368 states and 25353 transitions. [2019-12-26 22:21:10,913 INFO L78 Accepts]: Start accepts. Automaton has 8368 states and 25353 transitions. Word has length 66 [2019-12-26 22:21:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:10,914 INFO L462 AbstractCegarLoop]: Abstraction has 8368 states and 25353 transitions. [2019-12-26 22:21:10,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:21:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8368 states and 25353 transitions. [2019-12-26 22:21:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:10,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:10,929 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-26 22:21:10,930 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-26 22:21:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-26 22:21:10,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:10,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815677292] [2019-12-26 22:21:10,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:11,163 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-26 22:21:11,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815677292] [2019-12-26 22:21:11,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:11,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:11,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884798352] [2019-12-26 22:21:11,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:21:11,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:21:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:11,166 INFO L87 Difference]: Start difference. First operand 8368 states and 25353 transitions. Second operand 10 states. [2019-12-26 22:21:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:12,334 INFO L93 Difference]: Finished difference Result 14716 states and 43783 transitions. [2019-12-26 22:21:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:21:12,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:21:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:12,351 INFO L225 Difference]: With dead ends: 14716 [2019-12-26 22:21:12,351 INFO L226 Difference]: Without dead ends: 11117 [2019-12-26 22:21:12,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:21:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-26 22:21:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 8666. [2019-12-26 22:21:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-12-26 22:21:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 26101 transitions. [2019-12-26 22:21:12,514 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 26101 transitions. Word has length 67 [2019-12-26 22:21:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:12,514 INFO L462 AbstractCegarLoop]: Abstraction has 8666 states and 26101 transitions. [2019-12-26 22:21:12,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:21:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 26101 transitions. [2019-12-26 22:21:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:12,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:12,523 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-26 22:21:12,523 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-26 22:21:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-26 22:21:12,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:12,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779512437] [2019-12-26 22:21:12,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:12,672 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-26 22:21:12,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779512437] [2019-12-26 22:21:12,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:12,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:21:12,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99516494] [2019-12-26 22:21:12,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:21:12,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:21:12,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:21:12,675 INFO L87 Difference]: Start difference. First operand 8666 states and 26101 transitions. Second operand 10 states. [2019-12-26 22:21:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:13,906 INFO L93 Difference]: Finished difference Result 15216 states and 44769 transitions. [2019-12-26 22:21:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:13,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 22:21:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:13,923 INFO L225 Difference]: With dead ends: 15216 [2019-12-26 22:21:13,923 INFO L226 Difference]: Without dead ends: 12165 [2019-12-26 22:21:13,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:21:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-26 22:21:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 9002. [2019-12-26 22:21:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-26 22:21:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 26931 transitions. [2019-12-26 22:21:14,093 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 26931 transitions. Word has length 67 [2019-12-26 22:21:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:14,093 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 26931 transitions. [2019-12-26 22:21:14,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:21:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 26931 transitions. [2019-12-26 22:21:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:14,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:14,102 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-26 22:21:14,102 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-26 22:21:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-26 22:21:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811792103] [2019-12-26 22:21:14,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:14,275 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-26 22:21:14,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811792103] [2019-12-26 22:21:14,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:14,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:14,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505002562] [2019-12-26 22:21:14,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:14,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:14,277 INFO L87 Difference]: Start difference. First operand 9002 states and 26931 transitions. Second operand 11 states. [2019-12-26 22:21:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:15,510 INFO L93 Difference]: Finished difference Result 14588 states and 42742 transitions. [2019-12-26 22:21:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:21:15,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:15,527 INFO L225 Difference]: With dead ends: 14588 [2019-12-26 22:21:15,527 INFO L226 Difference]: Without dead ends: 11765 [2019-12-26 22:21:15,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:21:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-12-26 22:21:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 8714. [2019-12-26 22:21:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2019-12-26 22:21:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 26091 transitions. [2019-12-26 22:21:15,695 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 26091 transitions. Word has length 67 [2019-12-26 22:21:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:15,695 INFO L462 AbstractCegarLoop]: Abstraction has 8714 states and 26091 transitions. [2019-12-26 22:21:15,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 26091 transitions. [2019-12-26 22:21:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:15,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:15,704 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-26 22:21:15,704 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-26 22:21:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-26 22:21:15,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:15,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768920414] [2019-12-26 22:21:15,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:15,877 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-26 22:21:15,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768920414] [2019-12-26 22:21:15,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:15,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:15,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310208178] [2019-12-26 22:21:15,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:15,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:15,879 INFO L87 Difference]: Start difference. First operand 8714 states and 26091 transitions. Second operand 11 states. [2019-12-26 22:21:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:17,176 INFO L93 Difference]: Finished difference Result 10605 states and 31433 transitions. [2019-12-26 22:21:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:21:17,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:17,191 INFO L225 Difference]: With dead ends: 10605 [2019-12-26 22:21:17,191 INFO L226 Difference]: Without dead ends: 9442 [2019-12-26 22:21:17,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:21:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9442 states. [2019-12-26 22:21:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9442 to 8898. [2019-12-26 22:21:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8898 states. [2019-12-26 22:21:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 26560 transitions. [2019-12-26 22:21:17,342 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 26560 transitions. Word has length 67 [2019-12-26 22:21:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:17,342 INFO L462 AbstractCegarLoop]: Abstraction has 8898 states and 26560 transitions. [2019-12-26 22:21:17,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 26560 transitions. [2019-12-26 22:21:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:17,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:17,351 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-26 22:21:17,351 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-26 22:21:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2131583359, now seen corresponding path program 5 times [2019-12-26 22:21:17,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:17,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760445363] [2019-12-26 22:21:17,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:17,537 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-26 22:21:17,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760445363] [2019-12-26 22:21:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:17,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:17,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080399068] [2019-12-26 22:21:17,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:17,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:17,539 INFO L87 Difference]: Start difference. First operand 8898 states and 26560 transitions. Second operand 11 states. [2019-12-26 22:21:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:18,294 INFO L93 Difference]: Finished difference Result 13327 states and 39386 transitions. [2019-12-26 22:21:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:21:18,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:18,312 INFO L225 Difference]: With dead ends: 13327 [2019-12-26 22:21:18,312 INFO L226 Difference]: Without dead ends: 12308 [2019-12-26 22:21:18,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-26 22:21:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12308 states. [2019-12-26 22:21:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12308 to 10298. [2019-12-26 22:21:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10298 states. [2019-12-26 22:21:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 30723 transitions. [2019-12-26 22:21:18,495 INFO L78 Accepts]: Start accepts. Automaton has 10298 states and 30723 transitions. Word has length 67 [2019-12-26 22:21:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:18,495 INFO L462 AbstractCegarLoop]: Abstraction has 10298 states and 30723 transitions. [2019-12-26 22:21:18,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10298 states and 30723 transitions. [2019-12-26 22:21:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:18,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:18,505 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-26 22:21:18,505 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-26 22:21:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 6 times [2019-12-26 22:21:18,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:18,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061959788] [2019-12-26 22:21:18,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:18,687 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-26 22:21:18,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061959788] [2019-12-26 22:21:18,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:18,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:21:18,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382193259] [2019-12-26 22:21:18,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:21:18,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:21:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:21:18,690 INFO L87 Difference]: Start difference. First operand 10298 states and 30723 transitions. Second operand 11 states. [2019-12-26 22:21:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:19,612 INFO L93 Difference]: Finished difference Result 12574 states and 36849 transitions. [2019-12-26 22:21:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:21:19,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:21:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:19,629 INFO L225 Difference]: With dead ends: 12574 [2019-12-26 22:21:19,629 INFO L226 Difference]: Without dead ends: 10559 [2019-12-26 22:21:19,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:21:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-12-26 22:21:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8416. [2019-12-26 22:21:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-26 22:21:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-26 22:21:19,942 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 67 [2019-12-26 22:21:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:19,942 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-26 22:21:19,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:21:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-26 22:21:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:19,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:19,950 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-26 22:21:19,951 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-26 22:21:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 7 times [2019-12-26 22:21:19,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:19,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690632946] [2019-12-26 22:21:19,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:21:20,500 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-26 22:21:20,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690632946] [2019-12-26 22:21:20,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:21:20,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:21:20,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662183718] [2019-12-26 22:21:20,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:21:20,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:21:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:21:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:21:20,502 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 15 states. [2019-12-26 22:21:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:21:23,372 INFO L93 Difference]: Finished difference Result 10728 states and 31310 transitions. [2019-12-26 22:21:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-26 22:21:23,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-26 22:21:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:21:23,387 INFO L225 Difference]: With dead ends: 10728 [2019-12-26 22:21:23,387 INFO L226 Difference]: Without dead ends: 10499 [2019-12-26 22:21:23,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 22:21:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10499 states. [2019-12-26 22:21:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10499 to 8696. [2019-12-26 22:21:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8696 states. [2019-12-26 22:21:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 25908 transitions. [2019-12-26 22:21:23,540 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 25908 transitions. Word has length 67 [2019-12-26 22:21:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:21:23,540 INFO L462 AbstractCegarLoop]: Abstraction has 8696 states and 25908 transitions. [2019-12-26 22:21:23,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:21:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 25908 transitions. [2019-12-26 22:21:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:21:23,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:21:23,549 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-26 22:21:23,549 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-26 22:21:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:21:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 8 times [2019-12-26 22:21:23,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:21:23,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544302598] [2019-12-26 22:21:23,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:21:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:21:23,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:21:23,664 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:21:23,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-26 22:21:23,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-26 22:21:23,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-26 22:21:23,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff1_thd3~0_Out409444334 ~b$r_buff0_thd3~0_In409444334) (= ~b$r_buff1_thd1~0_Out409444334 ~b$r_buff0_thd1~0_In409444334) (= ~x~0_In409444334 ~__unbuffered_p0_EAX~0_Out409444334) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In409444334 0)) (= 1 ~b$r_buff0_thd1~0_Out409444334) (= ~b$r_buff0_thd0~0_In409444334 ~b$r_buff1_thd0~0_Out409444334) (= ~b$r_buff0_thd2~0_In409444334 ~b$r_buff1_thd2~0_Out409444334)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In409444334, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In409444334, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In409444334, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In409444334, ~x~0=~x~0_In409444334, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In409444334} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out409444334, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In409444334, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out409444334, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In409444334, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out409444334, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out409444334, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In409444334, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out409444334, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out409444334, ~x~0=~x~0_In409444334, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In409444334} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-26 22:21:23,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd2~0_In1433915075 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In1433915075 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1433915075| ~b$w_buff1~0_In1433915075)) (and (= ~b~0_In1433915075 |P1Thread1of1ForFork0_#t~ite9_Out1433915075|) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1433915075, ~b~0=~b~0_In1433915075, ~b$w_buff1~0=~b$w_buff1~0_In1433915075, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1433915075} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1433915075, ~b~0=~b~0_In1433915075, ~b$w_buff1~0=~b$w_buff1~0_In1433915075, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1433915075|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1433915075} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 22:21:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 22:21:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-822844644 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-822844644 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-822844644|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-822844644| ~b$w_buff0_used~0_In-822844644)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-822844644, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-822844644} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-822844644, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-822844644, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-822844644|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 22:21:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff0_used~0_In-272617107 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In-272617107 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-272617107 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-272617107 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-272617107 |P1Thread1of1ForFork0_#t~ite12_Out-272617107|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-272617107|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-272617107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-272617107, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-272617107, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-272617107} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-272617107, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-272617107, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-272617107, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-272617107|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-272617107} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 22:21:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In-2064483483 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-2064483483 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out-2064483483| 0)) (and (= ~b$r_buff0_thd2~0_In-2064483483 |P1Thread1of1ForFork0_#t~ite13_Out-2064483483|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2064483483, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2064483483} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2064483483, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2064483483, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2064483483|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 22:21:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-544728059 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-544728059 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In-544728059 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-544728059 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-544728059| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite14_Out-544728059| ~b$r_buff1_thd2~0_In-544728059) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-544728059, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-544728059, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-544728059, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-544728059} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-544728059, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-544728059, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-544728059, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-544728059|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-544728059} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 22:21:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:21:23,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1824199416 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1824199416 256)))) (or (and .cse0 (= (mod ~b$r_buff1_thd3~0_In1824199416 256) 0)) (and .cse0 (= 0 (mod ~b$w_buff1_used~0_In1824199416 256))) (= 0 (mod ~b$w_buff0_used~0_In1824199416 256)))) (= |P2Thread1of1ForFork1_#t~ite20_Out1824199416| ~b$w_buff0~0_In1824199416) (= |P2Thread1of1ForFork1_#t~ite20_Out1824199416| |P2Thread1of1ForFork1_#t~ite21_Out1824199416|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In1824199416| |P2Thread1of1ForFork1_#t~ite20_Out1824199416|) (= |P2Thread1of1ForFork1_#t~ite21_Out1824199416| ~b$w_buff0~0_In1824199416)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1824199416, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1824199416, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1824199416|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1824199416, ~b$w_buff0~0=~b$w_buff0~0_In1824199416, ~weak$$choice2~0=~weak$$choice2~0_In1824199416, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1824199416} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1824199416, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1824199416, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1824199416|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1824199416|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1824199416, ~b$w_buff0~0=~b$w_buff0~0_In1824199416, ~weak$$choice2~0=~weak$$choice2~0_In1824199416, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1824199416} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 22:21:23,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In874010441 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In874010441| |P2Thread1of1ForFork1_#t~ite26_Out874010441|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out874010441| ~b$w_buff0_used~0_In874010441)) (and (= |P2Thread1of1ForFork1_#t~ite26_Out874010441| ~b$w_buff0_used~0_In874010441) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In874010441 256) 0))) (or (and .cse1 (= (mod ~b$r_buff1_thd3~0_In874010441 256) 0)) (= (mod ~b$w_buff0_used~0_In874010441 256) 0) (and (= 0 (mod ~b$w_buff1_used~0_In874010441 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork1_#t~ite27_Out874010441| |P2Thread1of1ForFork1_#t~ite26_Out874010441|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In874010441, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In874010441, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In874010441|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In874010441, ~weak$$choice2~0=~weak$$choice2~0_In874010441, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In874010441} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In874010441, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out874010441|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In874010441, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out874010441|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In874010441, ~weak$$choice2~0=~weak$$choice2~0_In874010441, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In874010441} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-26 22:21:23,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 22:21:23,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-26 22:21:23,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In595845159 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In595845159 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out595845159| ~b$w_buff1~0_In595845159)) (and (or .cse1 .cse0) (= ~b~0_In595845159 |P2Thread1of1ForFork1_#t~ite38_Out595845159|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In595845159, ~b~0=~b~0_In595845159, ~b$w_buff1~0=~b$w_buff1~0_In595845159, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In595845159} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out595845159|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In595845159, ~b~0=~b~0_In595845159, ~b$w_buff1~0=~b$w_buff1~0_In595845159, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In595845159} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-26 22:21:23,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-26 22:21:23,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1240338723 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1240338723 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1240338723 |P2Thread1of1ForFork1_#t~ite40_Out-1240338723|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-1240338723|) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1240338723, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1240338723} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1240338723, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1240338723, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1240338723|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 22:21:23,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In1013953395 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1013953395 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In1013953395 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In1013953395 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out1013953395| 0)) (and (= ~b$w_buff1_used~0_In1013953395 |P2Thread1of1ForFork1_#t~ite41_Out1013953395|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1013953395, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1013953395, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1013953395, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1013953395} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1013953395, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1013953395, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1013953395, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1013953395|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1013953395} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-26 22:21:23,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-692487079 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-692487079 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out-692487079| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-692487079| ~b$r_buff0_thd3~0_In-692487079)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-692487079, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-692487079} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-692487079, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-692487079, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-692487079|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-26 22:21:23,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-892017656 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-892017656 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-892017656 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-892017656 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-892017656|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-892017656| ~b$r_buff1_thd3~0_In-892017656) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-892017656, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-892017656, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-892017656, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-892017656} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-892017656, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-892017656, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-892017656|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-892017656, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-892017656} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 22:21:23,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:21:23,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In600300731 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In600300731 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out600300731| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In600300731 |P0Thread1of1ForFork2_#t~ite5_Out600300731|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In600300731, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In600300731} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In600300731, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In600300731, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out600300731|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:21:23,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1754692131 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1754692131 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1754692131 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In-1754692131 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1754692131| ~b$w_buff1_used~0_In-1754692131) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1754692131| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1754692131, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1754692131, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1754692131, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1754692131} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1754692131, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1754692131, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1754692131, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1754692131, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1754692131|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:21:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In1296027285 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1296027285 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd1~0_In1296027285 ~b$r_buff0_thd1~0_Out1296027285)) (and (not .cse1) (= 0 ~b$r_buff0_thd1~0_Out1296027285) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1296027285, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1296027285} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1296027285, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1296027285, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1296027285|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:21:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-820506560 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-820506560 256))) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-820506560 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-820506560 256)))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-820506560|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite8_Out-820506560| ~b$r_buff1_thd1~0_In-820506560) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-820506560, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-820506560, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-820506560, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-820506560} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-820506560, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-820506560, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-820506560, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-820506560, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-820506560|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:21:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:21:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:21:23,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-1194579931 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-1194579931 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1194579931| ~b$w_buff1~0_In-1194579931) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1194579931| ~b~0_In-1194579931) (or .cse1 .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1194579931, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1194579931, ~b~0=~b~0_In-1194579931, ~b$w_buff1~0=~b$w_buff1~0_In-1194579931} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1194579931, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1194579931, ~b~0=~b~0_In-1194579931, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1194579931|, ~b$w_buff1~0=~b$w_buff1~0_In-1194579931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:21:23,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:21:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1653625122 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In1653625122 256) 0))) (or (and (= ~b$w_buff0_used~0_In1653625122 |ULTIMATE.start_main_#t~ite49_Out1653625122|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1653625122| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1653625122, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1653625122} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1653625122, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1653625122|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1653625122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:21:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1409328242 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In1409328242 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In1409328242 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In1409328242 256)))) (or (and (= ~b$w_buff1_used~0_In1409328242 |ULTIMATE.start_main_#t~ite50_Out1409328242|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1409328242| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1409328242, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1409328242, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1409328242, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1409328242} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1409328242|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In1409328242, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1409328242, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1409328242, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1409328242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:21:23,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In1822105011 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In1822105011 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out1822105011| ~b$r_buff0_thd0~0_In1822105011) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1822105011| 0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1822105011, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1822105011} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1822105011, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1822105011|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1822105011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:21:23,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In961952464 256) 0)) (.cse3 (= (mod ~b$w_buff1_used~0_In961952464 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In961952464 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In961952464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out961952464|)) (and (= ~b$r_buff1_thd0~0_In961952464 |ULTIMATE.start_main_#t~ite52_Out961952464|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In961952464, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In961952464, ~b$w_buff1_used~0=~b$w_buff1_used~0_In961952464, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In961952464} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In961952464, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out961952464|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In961952464, ~b$w_buff1_used~0=~b$w_buff1_used~0_In961952464, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In961952464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:21:23,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:21:23,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:21:23 BasicIcfg [2019-12-26 22:21:23,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:21:23,816 INFO L168 Benchmark]: Toolchain (without parser) took 111043.65 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,817 INFO L168 Benchmark]: CDTParser took 1.57 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.19 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 156.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.43 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,818 INFO L168 Benchmark]: Boogie Preprocessor took 41.07 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,818 INFO L168 Benchmark]: RCFGBuilder took 840.04 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 100.9 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,819 INFO L168 Benchmark]: TraceAbstraction took 109245.63 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-26 22:21:23,821 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.19 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 156.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.43 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.07 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.04 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 100.9 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109245.63 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7255 SDtfs, 11725 SDslu, 26190 SDs, 0 SdLazy, 15092 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 78 SyntacticMatches, 15 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 33.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 176768 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1711 NumberOfCodeBlocks, 1711 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 324673 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...